莫队,然后每次查询逆序对个数,没了。
#include<cstdio>
#include<cstring>
#include<iostream>
#include<cmath>
#include<algorithm>
#define LL long long
#define maxn 50021
using namespace std;
int n,Q,block,c[maxn*2],t[maxn],a[maxn],cnt;LL Ans[maxn];
struct ques{
int l,r,id;
bool operator<(const ques& b)const{
return (l-1)/block+1==(b.l-1)/block+1 ? r<b.r : (l-1)/block+1<(b.l-1)/block+1;
}
}q[maxn];
void update(int x,int add){
while(x<=cnt){c[x]+=add;x+=x&-x;}
}
int query(int x){
int ans=0;
while(x>0){ans+=c[x];x-=x&-x;}
return ans;
}
int main(){
scanf("%d",&n);block=sqrt(n);
for(int i=1;i<=n;i++)scanf("%d",a+i),t[i]=a[i];
sort(t+1,t+1+n);cnt=unique(t+1,t+1+n)-t-1;
for(int i=1;i<=n;i++)a[i]=lower_bound(t+1,t+1+cnt,a[i])-t;
scanf("%d",&Q);
for(int i=1;i<=Q;i++)scanf("%d%d",&q[i].l,&q[i].r),q[i].id=i;
sort(q+1,q+1+Q);
int l=1,r=0;LL ans=0;
for(int i=1;i<=Q;i++){
while(l<q[i].l)ans-=query(a[l]-1),update(a[l++],-1);
while(l>q[i].l)ans+=query(a[--l]-1),update(a[l],1);
while(r<q[i].r)ans+=(r-l+1)-query(a[++r]),update(a[r],1);
while(r>q[i].r)ans-=(r-l+1)-query(a[r]),update(a[r--],-1);
Ans[q[i].id]=ans;
}
for(int i=1;i<=Q;i++)printf("%lld\n",Ans[i]);
return 0;
}