POJ1990 MooFest

  题目链接：http://poj.org/problem?id=1990

  树状数组，统计的时候显然不可以一对一对地加上去

  可以先按照v[i]升序

  当前位置前后面分类讨论，所以用两个树状数组，一个统计个数，一个统计距离，可以通过作差计算，注意不要算岔了

  贴代码

#include<cstdio>
#include<stdlib.h>
#include<cstring> 
#include<ctime>
using namespace std;
typedef long long ll;
const int maxl=20005,maxn=20005;
int a[maxn],b[maxn],c[maxl];
ll d[maxl];
int n;
void swap(int &x,int &y){
	int t;
	t=x;x=y;y=t;
}
void qsort(int L,int R){
	int i,j,mid;
	srand((unsigned)time(NULL));
	i=L;j=R;mid=a[rand()%(R-L+1)+L];
	do{
		while (a[i]<mid)i++;
		while (a[j]>mid)j--;
  		if (i<=j){swap(a[i],a[j]),swap(b[i],b[j]);i++;j--;}
	}while (i<=j);
	if (i<R)qsort(i,R);
	if (L<j)qsort(L,j);	
}
int lowbit(int x){
	return x&-x;
}
void add(int x,ll y){
	for (int i=x;i<=20000;i+=lowbit(i)){c[i]++;d[i]+=y;}
}
int query_num(int x){
	int sum=0;
	for (int i=x;i>=1;i-=lowbit(i))sum+=c[i];
	return sum;
}
ll query_sum(int x){
	ll sum=0;
	for (int i=x;i>=1;i-=lowbit(i))sum+=d[i];
	return sum;
}
int main(){
//	freopen("1990.in","r",stdin);
//	freopen("1990.out","w",stdout);
	scanf("%d",&n);
	memset(c,0,sizeof(c));
	memset(d,0,sizeof(d));
	for (int i=1;i<=n;i++)scanf("%d%d",&a[i],&b[i]);
	qsort(1,n);
	ll ans=0;
	add(b[1],ll(b[1]));
	for (int i=2;i<=n;i++){
		ll x;
		int y;
		y=query_num(b[i]-1);
		if (y!=0){
		   x=abs(query_sum(b[i]-1)-y*b[i]);
		   ans+=x*a[i];
  		}
		y=query_num(20000)-query_num(b[i]);
		if (y!=0){
		   x=abs(query_sum(20000)-query_sum(b[i])-y*b[i]);
		   ans+=x*a[i];
  		}
		add(b[i],ll(b[i]));
	}
	printf("%I64d",ans);
	return 0;
}

【写的有漏洞的，欢迎路过大神吐槽】

  2017/07/07 17:05:30

  Ending.