bzoj 4994 [Usaco2017 Feb]Why Did the Cow Cross the Road III

http://www.elijahqi.win/archives/3204
Description

给定长度为2N的序列，1~N各处现过2次，i第一次出现位置记为ai，第二次记为bi，求满足ai

#include<cstdio>
#include<cctype>
#include<algorithm>
using namespace std;
inline char gc(){
    static char now[1<<16],*S,*T;
    if (T==S){T=(S=now)+fread(now,1,1<<16,stdin);if (T==S) return EOF;}
    return *S++; 
}
inline int read(){
    int x=0,f=1;char ch=gc();
    while(!isdigit(ch)) {if (ch=='-') f=-1;ch=gc();}
    while(isdigit(ch)) x=x*10+ch-'0',ch=gc();
    return x*f;
}
const int N=100010;
struct node{
    int a,b;
}pos[N];
int a[N],n,ans,s[N],n1;
inline bool cmp(const node &a,const node &b){return a.a<b.a;}
inline void add(int x,int v){while(x<=n1) s[x]+=v,x+=x&-x;}
inline int query(int x) {
    static int tmp;tmp=0;while(x) tmp+=s[x],x-=x&-x;return tmp;
}
int main(){
    freopen("bzoj4994.in","r",stdin);
    n=read();for (int i=1;i<=n<<1;++i) a[i]=read();n1=n<<1;
    for (int i=1;i<=n<<1;++i) if (!pos[a[i]].a) pos[a[i]].a=i;else pos[a[i]].b=i;
    sort(pos+1,pos+n+1,cmp);
    for (int i=1;i<=n;++i){
        ans+=query(pos[i].b)-query(pos[i].a);
        add(pos[i].b,1);
    }printf("%d\n",ans);
}