POJ 1990 MooFest(想法题&树状数组)

MooFest

http://poj.org/problem?id=1990

Time Limit:  1000MS

Memory Limit:  30000K

Description

Every year, Farmer John's N (1 <= N <= 20,000) cows attend "MooFest",a social gathering of cows from around the world. MooFest involves a variety of events including haybale stacking, fence jumping, pin the tail on the farmer, and of course, mooing. When the cows all stand in line for a particular event, they moo so loudly that the roar is practically deafening. After participating in this event year after year, some of the cows have in fact lost a bit of their hearing. 

Each cow i has an associated "hearing" threshold v(i) (in the range 1..20,000). If a cow moos to cow i, she must use a volume of at least v(i) times the distance between the two cows in order to be heard by cow i. If two cows i and j wish to converse, they must speak at a volume level equal to the distance between them times max(v(i),v(j)). 

Suppose each of the N cows is standing in a straight line (each cow at some unique x coordinate in the range 1..20,000), and every pair of cows is carrying on a conversation using the smallest possible volume. 

Compute the sum of all the volumes produced by all N(N-1)/2 pairs of mooing cows. 

Input

* Line 1: A single integer, N 

* Lines 2..N+1: Two integers: the volume threshold and x coordinate for a cow. Line 2 represents the first cow; line 3 represents the second cow; and so on. No two cows will stand at the same location. 

Output

* Line 1: A single line with a single integer that is the sum of all the volumes of the conversing cows. 

Sample Input

4
3 1
2 5
2 6
4 3

Sample Output

57

题意抽象：

在数轴上有一列互不相同点xN(1 <= N <= 20,000 , 1 <= xi <= 20,000 )，每个点有一个权值vi(1 <= vi <= 20,000)，

对每对点xi,xj，算出|xi - xj| * max{vi,vj}，然后求这些结果的和。

思路：

1. 首先将这n个点按照v值从小到大排序（后面说的排在谁的前面，都是基于这个排序）。

这样，当i<j时有max{vi,vj}=vj，

2. 用两个树状数组，一个记录比xi小的点的个数a，一个记录比xi小的点的位置之和b，

然后，我们可以快速地求出xi与比xi小的点的所有距离的绝对值之和：a*x[i]-b，

也可以方便地求出xi与比xi大的点的所有距离的绝对值之和：所有距离-b-(i-1-a)*x[i]。

将二者相加，乘上vi，再把所有结果相加，搞定。

复杂度：

反思：

排序很重要，排哪个元素的序更重要。

完整代码：

/*47ms,800KB*/

#include <cstdio>
#include <cstring>
#include <algorithm>
#define MAXN 20001
using namespace std;

long long num[2][MAXN];

struct Node
{
	long long v, x;
	bool operator < (const Node& a) const
	{
		return v < a.v;//按音量排序
	}
} node[MAXN];

long long sum(int pos, int d)
{
	long long ans = 0;
	while (pos > 0)
	{
		ans += num[d][pos];
		pos -= -pos & pos;
	}
	return ans;
}

void update(int pos, long long v, int d)
{
	while (pos < MAXN)
	{
		num[d][pos] += v;
		pos += -pos & pos;
	}
}

int main()
{
	int n;
	scanf("%d", &n);
	memset(num, 0, sizeof(num));
	for (int i = 1; i <= n; i++)
		scanf("%lld%lld", &node[i].v, &node[i].x);
	sort(node + 1, node + 1 + n);
	
	long long a, b, ans = 0;
	for (int i = 1; i < n;)
	{
		update(node[i].x, 1, 0);//有点，就+1
		update(node[i].x, node[i].x, 1);//把位置xi放到树状数组b中
		a = sum(node[++i].x, 0);
		b = sum(node[i].x, 1);
		//稍微化简了下
		ans += (sum(MAXN - 1, 1) - (b << 1) - (i - 1 - (a << 1)) * node[i].x) * node[i].v;
	}
	printf("%lld\n", ans);
	return 0;
}