POJ 1990

1. Brute Force方法导致TLE

2. 数组树做法，先按照v升序排序。然后对排序好的Cow循环，假设在i位置的cow，那么0到i-1位置的cow的v都比当前v小，则可以利用公式

v * (prevCnt * x - prevDist + totalDist - prevDist - (i - prevCnt) * x)算出。

v * (prevCnt * x - prevDist)为左半部分

v * (totalDist - prevDist - (i - prevCnt) * x)为右半部分

资料：关于lowbit函数

http://wenku.baidu.com/view/3f9579c689eb172ded63b7c4.html

#include <iostream>
#include <algorithm>
using namespace std;


const int MAXN = 20001;


int cnt[MAXN];
int dist[MAXN];


struct Cow
{
int x;
int v;
bool operator<(const Cow& c) const
{
return v < c.v;
};
}cows[20001];


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


void insert(int *a, int p, int value)
{
while(p <= MAXN)
{
a[p] += value;
p += lowbit(p);
}


};


int sum(int* a, int p)
{
int res = 0;
while(p > 0)
{
res += a[p];
p -= lowbit(p);
}
return res;
};






int main()
{
int n;
cin >> n;
for(int i = 0; i < n; i++)
{
cin >> cows[i].v >> cows[i].x;
}
sort(cows, cows + n);


long long res = 0;
int totalDist = 0;

for(int i = 0; i < n; i++)
{
int x = cows[i].x;
int v = cows[i].v;
int prevDist = sum(dist, x);
int prevCnt = sum(cnt, x);
res += (long long)v * (prevCnt * x - prevDist + totalDist - prevDist - (i - prevCnt) * x);
insert(dist, x, x);
insert(cnt, x, 1);
totalDist += x;
}
cout << res;
return 0;
}