#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
struct node{
long long x,v,owz;
bool cmp;
} q[1000000];
bool cmp(node i,node j){
return i.x>j.x;
}
long long an[1000000],n,m,maxn,i,ans,a[1000000],c[1000000],j,l[1000000],
r[1000000],ql[1000000],qr[1000000];
void insert(long long x,long long v){
for (;x<=maxn;x+=x&-x)
c[x]+=v;
}
/*void insert2(int x,int v){
for (;x>0;x-=x&-x)
c[x]+=v;
}*/
long long sum(lon......
阅读全文