P1975 [国家集训队]排队

题目链接

题意分析

我们考虑 交换两个数\([le,ri]\)的贡献

减少的逆序对数\([le,ri]\)中小于\(num[le]\)以及大于\(num[ri]\)的数

增加的\([le,ri]\)中大于\(num[le]\)以及小于\(num[ri]\)的数

同时注意 如果\(num[le]!=num[ri]\)

二者相互的贡献 就多算了一次

所以我们需要特判一下

至于修改和查询 我们可以使用树套树维护

CODE:

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<cstdlib>
#include<string>
#include<queue>
#include<map>
#include<stack>
#include<list>
#include<set>
#include<deque>
#include<vector>
#include<ctime>
#define ll long long
#define inf 0x7fffffff
#define N 150008
#define IL inline
#define M 1008611
#define D double
#define ull unsigned long long
#define R register
using namespace std;
template<typename T>IL void read(T &_)
{
    T __=0,___=1;char ____=getchar();
    while(!isdigit(____)) {if(____=='-') ___=0;____=getchar();}
    while(isdigit(____)) {__=(__<<1)+(__<<3)+____-'0';____=getchar();}
    _=___ ? __:-__;
}
/*-------------OI使我快乐-------------*/
int n,q,tot,cnt,cnta,cntb,top;ll ans;
int num[N],res[N],sta[N],tmp[N];
int root[N],lson[N*50],rson[N*50],siz[N*50];
int cdy[N],wzy[N];
IL int new_code(){return top ? sta[top--]:++tot;}
IL void solve(int le,int ri)
{
    if(le==ri) return;
    int mid=(le+ri)>>1;
    solve(le,mid);solve(mid+1,ri);
    int ix=le,jx=mid+1,kx=le;
    for(;ix<=mid&&jx<=ri;)
    {
        if(res[ix]<=res[jx]) tmp[kx++]=res[ix++];
        else ans+=mid-ix+1,tmp[kx++]=res[jx++];
    }
    for(;ix<=mid;) tmp[kx++]=res[ix++];
    for(;jx<=ri;) tmp[kx++]=res[jx++];
    for(R int i=le;i<=ri;++i) res[i]=tmp[i];
}
IL void insert(int &now,int le,int ri,int pos,int d)
{
    if(!now) now=new_code();siz[now]+=d;
    if(le==ri) return;
    int mid=(le+ri)>>1;
    if(pos<=mid) insert(lson[now],le,mid,pos,d);
    else insert(rson[now],mid+1,ri,pos,d);
    if(!siz[now]) sta[++top]=now,now=0;
}
IL void add(int x,int pos,int d)
{
    for(R int i=x;i<=n;i+=i&-i) insert(root[i],1,cnt,pos,d);
}
IL void prework(int le,int ri)
{
    cnta=cntb=0;
    for(R int x=le-1;x;x-=x&-x) cdy[++cnta]=root[x];
    for(R int x=ri;x;x-=x&-x) wzy[++cntb]=root[x];
}
IL int getsum()
{
    int res=0;
    for(R int i=1;i<=cnta;++i) res-=siz[cdy[i]];
    for(R int i=1;i<=cntb;++i) res+=siz[wzy[i]];
    return res;
}
IL int getsumcdy()
{
    int res=0;
    for(R int i=1;i<=cnta;++i) res-=siz[lson[cdy[i]]];
    for(R int i=1;i<=cntb;++i) res+=siz[lson[wzy[i]]];
    return res;
}
IL int getsumwzy()
{
    int res=0;
    for(R int i=1;i<=cnta;++i) res-=siz[rson[cdy[i]]];
    for(R int i=1;i<=cntb;++i) res+=siz[rson[wzy[i]]];
    return res;
}
IL void pushcdy()
{
    for(R int i=1;i<=cnta;++i) cdy[i]=lson[cdy[i]];
    for(R int i=1;i<=cntb;++i) wzy[i]=lson[wzy[i]];
}
IL void pushwzy()
{
    for(R int i=1;i<=cnta;++i) cdy[i]=rson[cdy[i]];
    for(R int i=1;i<=cntb;++i) wzy[i]=rson[wzy[i]];
}
IL int get_cdy(int le,int ri,int pos)
{
    if(pos<1) return 0;
    if(le==ri) return getsum();
    int mid=(le+ri)>>1,tmp=getsumcdy();
    if(pos<=mid) {pushcdy();return get_cdy(le,mid,pos);}
    else {pushwzy();return get_cdy(mid+1,ri,pos)+tmp;}
}
IL int get_wzy(int le,int ri,int pos)
{
    if(pos>cnt) return 0;
    if(le==ri) return getsum();
    int mid=(le+ri)>>1,tmp=getsumwzy();
    if(pos<=mid) {pushcdy();return get_wzy(le,mid,pos)+tmp;}
    else {pushwzy();return get_wzy(mid+1,ri,pos);}
}
int main()
{
//  freopen("cd.in","r",stdin);
//  freopen("cd.out","w",stdout);
    read(n);
    for(R int i=1;i<=n;++i) read(num[i]),res[i]=num[i];
    solve(1,n);cnt=unique(res+1,res+n+1)-res-1;
    for(R int i=1;i<=n;++i) num[i]=lower_bound(res+1,res+cnt+1,num[i])-res; 
    for(R int i=1;i<=n;++i) add(i,num[i],1);
    printf("%lld\n",ans);
//  prework(1,n);
//  for(R int i=1;i<=n;++i) printf("%d%c",num[i],(i==n ? '\n':' '));
//  prework(1,n);
//  printf("%d\n",get_cdy(1,cnt,cnt));
//  prework(1,n);
//  printf("%d\n",get_wzy(1,cnt,1));    
    read(q);
    while(q--)
    {
        int x,y,tmpx,tmpy;read(x);read(y);
        if(x==y) continue;tmpx=num[x];tmpy=num[y];
//      printf("now is %d %d\n",tmpx,tmpy);
        int cdy,wzy,zjz,ghj;
        prework(x,y);       
        cdy=get_cdy(1,cnt,tmpx-1);
        prework(x,y);
        wzy=get_wzy(1,cnt,tmpx+1);
        prework(x,y);
        zjz=get_cdy(1,cnt,tmpy-1);
        prework(x,y);
        ghj=get_wzy(1,cnt,tmpy+1);
//      printf("check %d %d %d %d\n",cdy,wzy,zjz,ghj);
        ans=ans-cdy+wzy+zjz-ghj;
        if(tmpx<tmpy) ans--;
        else if(tmpx>tmpy) ans++;
        add(x,tmpx,-1);add(y,tmpy,-1);
        swap(num[x],num[y]);
        add(x,tmpy,1);add(y,tmpx,1);
        printf("%lld\n",ans);
    }
//  fclose(stdin);
//  fclose(stdout);
    return 0;
}

HEOI 2019 RP++

转载于:https://www.cnblogs.com/LovToLZX/p/10652777.html