CodeForces 831E-Cards Sorting(树状数组)

链接：http://codeforces.com/problemset/problem/831/E

思路：看成一个环，每次找到一个上次移除位置的前面一个最小值的位置，计算位置差，已经移除的空位用树状数组维护。

//QAQ
//#pragma comment(linker, "/stack:1024000000,1024000000")  
#include 
/*
#include 
#include 
#include 
#include 
#include 
*/
using namespace std;  
#define INF 0x3f3f3f3f  
#define MAXM 100005  
const double eps = 1e-8;
const double PI = acos(-1.0);
const long long mod=1e9+7;
const int MAXN = 1e6+7;
int a[MAXN];
long long b[MAXN];
vector v[MAXN];
int lowbit(int x)
{
	return x&-x;
}
long long sum(int x)
{
	long long ans=0;
	while(x)
	{
		ans+=b[x];
		x-=lowbit(x);
	}
	return ans;
}
void add_(int x, long long num)
{
	while(x<=MAXN)
	{
		b[x]+=num;
		x+=lowbit(x);
	}
}
int main()
{
	int n;
	long long ans=0;
	scanf("%d",&n);
	for(int i=0; i