[树状数组 线段树] BZOJ 3333 排队计划

Po姐：http://blog.csdn.net/popoqqq/article/details/40392219?utm_source=tuicool&utm_medium=referral

#include<cstdio>
#include<cstdlib>
#include<algorithm>
using namespace std;
typedef long long ll;

inline char nc()
{
	static char buf[100000],*p1=buf,*p2=buf;
	if (p1==p2) { p2=(p1=buf)+fread(buf,1,100000,stdin); if (p1==p2) return EOF; }
	return *p1++;
}

inline void read(int &x){
	char c=nc(),b=1;
	for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
	for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}

const int N=500005;

namespace BIT{
	int maxn,c[N];
	#define lowbit(i) ((i)&-(i))
	inline void init(int n){
		maxn=n;
	}
	inline void add(int x,int r){
		for (int i=x;i<=maxn;i+=lowbit(i))
			c[i]+=r;
	}
	inline int sum(int x){
		int ret=0;
		for (int i=x;i;i-=lowbit(i))
			ret+=c[i];
		return ret;
	}
}

int sx[N],icnt;

inline int Bin(int x){
	return lower_bound(sx+1,sx+icnt+1,x)-sx;
}

struct abcd{
	int first,second;
	abcd(int val=0,int pos=0):first(val),second(pos) {}
	bool operator < (const abcd &B) const{
		return first==B.first?second>B.second:first<B.first;
	}
};

int n; ll ans;
int a[N],f[N];

int M; abcd T[N<<2];

inline void Build(int n){
	for (M=1;M<n+2;M<<=1);
	for (int i=1;i<=n;i++)
		T[M+i]=abcd(a[i],i);
	for (int i=M-1;i;i--)
		T[i]=min(T[i<<1],T[i<<1|1]);
}
inline void Modify(int x,int r)
{
	int s;
	T[s=x+M]=abcd(r,x);
	while (s>>=1)
		T[s]=min(T[s<<1],T[s<<1|1]);
}
inline abcd Query(int s,int t){
	abcd ret(1<<30,0);
	for (s+=M-1,t+=M+1;s^t^1;s>>=1,t>>=1)
	{
		if (~s&1) ret=min(ret,T[s^1]);
		if ( t&1) ret=min(ret,T[t^1]);
	}
	return ret;
}

int main()
{
	int p,Q;
	freopen("t.in","r",stdin);
	freopen("t.out","w",stdout);
	read(n); read(Q); 
	for (int i=1;i<=n;i++) read(a[i]),sx[++icnt]=a[i];
	sort(sx+1,sx+icnt+1),icnt=unique(sx+1,sx+icnt+1)-sx-1;
	for (int i=1;i<=n;i++) a[i]=Bin(a[i]);
	BIT::init(icnt);
	for (int i=n;i;i--)
	{
		f[i]=BIT::sum(a[i]-1);
		BIT::add(a[i],1);
		ans+=f[i];
	}
	Build(n);
	printf("%lld\n",ans);
	while (Q--)
	{
		read(p);
		while (a[p]!=1<<30)
		{
			abcd tem=Query(p,n);
			ans-=f[tem.second];
			a[tem.second]=1<<30;
			Modify(tem.second,1<<30);
		}
		printf("%lld\n",ans);
	}
	return 0;
}