题目链接:https://codeforces.com/contest/540/problem/E
题目大意:有一个无限的序列,给出n个交换,问逆序对个数
题目思路:难点在于没有参与交换的点如何处理。该题可将没使用的这段区间看做点,先记录所有参与交换的点, 然后进行离散化,如果相邻的点之间还有数字,就将这些数字缩成一个点。然后更新时,d[i]存的是之前有多少比d[i]大的数字,由于这些数字比d[i]大,如果是区间就是比区间所有数都大,那么每个数字会产生num[i]个逆序对,然后更新树状数组,树状数组朝前更新,维护比i大的数字个数。
以下是代码:
#include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<math.h>
using namespace std;
#define inf 0x3f3f3f3f
#define rep(i,a,b) for(ll i=a;i<=b;i++)
#define per(i,a,b) for(ll i=a;i>=b;i--)
#define ll long long
const ll MAXN = 5e5+5;
const ll MOD = 1e9+7;
ll n,x,y,b[MAXN],c[MAXN],d[MAXN],num[MAXN],sum[MAXN];
struct node{
ll x,y;
}a[MAXN];
ll lowbit(ll x){
return x & -x;
}
void add(ll x,ll y){
while(x){
sum[x]+=y;
x-=lowbit(x);
}
}
ll query(ll x){
ll ans=0;
while(x<MAXN){
ans+=sum[x];
x+=lowbit(x);
}
return ans;
}
int main()
{
while(~scanf("%I64d",&n)){
memset(sum,0,sizeof(sum));
ll t=0,tnt=0;
rep(i,1,n){
scanf("%I64d%I64d",&a[i].x,&a[i].y);
b[++t]=a[i].x;
b[++t]=a[i].y;
}
sort(b+1,b+t+1);
t=unique(b+1,b+t+1)-b-1;
rep(i,1,t){
if(b[i-1]+1!=b[i]){
c[++tnt]=b[i-1]+1;
num[tnt]=b[i]-b[i-1]-1;
}
c[++tnt]=b[i];
num[tnt]=1;
}
rep(i,1,tnt)d[i]=i;
rep(i,1,n){
ll l=lower_bound(c+1,c+tnt+1,a[i].x)-c;
ll r=lower_bound(c+1,c+tnt+1,a[i].y)-c;
swap(d[l],d[r]);
swap(num[l],num[r]);
}
ll ans=0;
rep(i,1,tnt){
ans+=num[i]*query(d[i]);
add(d[i],num[i]);
}
printf("%I64d\n",ans);
}
return 0;
}