题目来源:POJ 1990 MooFest
题意:就算每两头牛之间声音值 2头牛v的最大值*2头牛之间的距离
思路:按照v从小到大插入树状数组 因为从小到大排序 每插入一头牛i 当前v最大值就是牛i的v
统计x比他小的个数s1 x比他大的个数s2 s2 就是当前树状数组牛的数量减去s1在减一
统计x比他小的距离l1 和 x比他大的距离l2 l2就是所有牛x之和-l1
x*s1-l1就是所有位于牛i左边的牛和牛i的距离之和
l2-x*s2就是所有位于牛右左边的牛和牛i的距离之和
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn = 20010;
struct node
{
int v, x;
}a[maxn];
long long c[2][maxn];
int n, m;
bool cmp(node a, node b)
{
return a.v < b.v;
}
int lowbit(int x)
{
return x&(-x);
}
void update(int x, int y, int d)
{
while(x <= 20000)
{
c[d][x] += y;
x += lowbit(x);
}
}
long long sum(int x, int d)
{
int ret = 0;
while(x > 0)
{
ret += c[d][x];
x -= lowbit(x);
}
return ret;
}
int main()
{
scanf("%d", &n);
for(int i = 1; i <= n; i++)
scanf("%d %d", &a[i].v, &a[i].x);
sort(a+1, a+n+1, cmp);
long long ans = 0;
for(int i = 1; i <= n; i++)
{
int v = a[i].v;
int x = a[i].x;
long long s1 = sum(20000, 0);
long long s2 = sum(x, 0);
long long l1 = sum(20000, 1);
long long l2 = sum(x, 1);
ans += (x*s2-l2+l1-l2-x*(i-s2-1))*v;
update(a[i].x, 1, 0);
update(a[i].x, a[i].x, 1);
}
printf("%lld\n", ans);
return 0;
}