3289: Mato的文件管理 莫队算法+树状数组

还以为编号在1-n以内就没离散化结果RE。。。
裸的莫队。。树状数组维护一下逆序对。

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#define ll long long 
#define lowbit(i) (i&(-i))
using namespace std;
int n,q,c[50005],d[50005],pos[50005],tree[50005];
ll ans;
struct node {int l,r,id; ll ans;} a[50005];
inline int read()
{
    int a=0,f=1; char c=getchar();
    while (c<'0'||c>'9') {if (c=='-') f=-1; c=getchar();}
    while (c>='0'&&c<='9') {a=a*10+c-'0'; c=getchar();}
    return a*f;
}
inline bool cmp(node a,node b)
{
    return pos[a.l]==pos[b.l]?a.r<b.r:a.l<b.l;
}
inline bool cmp0(node a,node b)
{
    return a.id<b.id;
}
inline void add(int x,int val)
{
    for (int i=x;i<=n;i+=lowbit(i)) tree[i]+=val;
}
inline ll query(int x)
{
    ll tmp=0;
    for (int i=x;i;i-=lowbit(i)) tmp+=tree[i];
    return tmp;
}
int main()
{
    n=read();
    for (int i=1;i<=n;i++) d[i]=c[i]=read();
    sort(d+1,d+n+1);
    for (int i=1;i<=n;i++) c[i]=lower_bound(d+1,d+n+1,c[i])-d;
    q=read();
    for (int i=1;i<=q;i++)
        a[i].l=read(),a[i].r=read(),a[i].id=i;
    int block=(int)(sqrt(n));
    for (int i=1;i<=n;i++) 
        pos[i]=(i-1)/block+1;
    sort(a+1,a+q+1,cmp);
    int l=1,r=0;
    for (int i=1;i<=q;i++)
    {
        for (;r<a[i].r;r++) 
            add(c[r+1],1),ans+=(r-l+2)-query(c[r+1]);
        for (;r>a[i].r;r--) 
            add(c[r],-1),ans-=(r-l)-query(c[r]);
        for (;l<a[i].l;l++) 
            add(c[l],-1),ans-=query(c[l]-1);
        for (;l>a[i].l;l--) 
            add(c[l-1],1),ans+=query(c[l-1]-1);
        a[i].ans=ans;
    }
    sort(a+1,a+q+1,cmp0);
    for (int i=1;i<=q;i++) printf("%lld\n",a[i].ans);
    return 0;
}