Poj 1990 MooFest

题目

求sigma{   Max(v[i],v[j]) * Dis(i,j) }

(i,j) 和 (j,i) 算重复计算.

对于Max(v[i]，v[j])排个序就行了，至于sigma{  Dis(i,pos) }，只需要知道pos的左边所有点的坐标和，和点数，右边点的坐标和和点数就行了

#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;

inline int input(){
	int ret=0;char c=getchar();
	while(c<'0' || c>'9') c=getchar();
	while(c>='0' && c<='9'){
		ret=ret*10+c-'0';
		c=getchar();
	}
	return ret;
}

typedef long long ll;

const int N=20005;
int n;
int c[N],b[N];
struct Cow{
	int v,x;
}cow[N];
bool cmp(Cow i,Cow j){
	return i.v>j.v;
}

ll ans;

inline int lowbit(int x){
	return x&(-x);
}

inline void add(int *c,int x,int v){
	while(x<=20000){
		c[x]+=v;
		x+=lowbit(x);
	}
}

inline ll sum(int *c,int x){
	ll ans=0;
	while(x>0){
		ans+=c[x];
		x-=lowbit(x);
	}
	return ans;
}
int main(){
	while(~scanf("%d",&n)){
		memset(c,0,sizeof(c));ans=0;
		memset(b,0,sizeof(b));
		for(int i=0;i<n;i++){
			scanf("%d%d",&cow[i].v,&cow[i].x);
			add(c,cow[i].x,cow[i].x);
			add(b,cow[i].x,1);
		}
		sort(cow,cow+n,cmp);
		for(int i=0;i<n;i++){
			ll v1=sum(c,cow[i].x-1),v2=sum(c,20000);
			int n1=sum(b,cow[i].x-1),n2=sum(b,20000);
			v2-=v1+cow[i].x;
			n2-=n1+1;
			ans+=(cow[i].x*1LL*n1-v1+v2-cow[i].x*1LL*n2)*1LL*cow[i].v;
			//printf("%lld zz\n",ans);
			add(c,cow[i].x,-cow[i].x);
			add(b,cow[i].x,-1);
		}
		printf("%lld\n",ans);
	}
	return 0;
}