题意
传送门 POJ 1990
题解
音量乘积的求和
∑ ( m a x ( v i , v j ) × ∣ x i − x j ∣ ) \sum (max(v_{i},v_{j})\times |x_{i}-x_{j}|) ∑(max(vi,vj)×∣xi−xj∣)
基本思路是按照音量值升序排序,对于每一头牛,乘以音量值比它小的牛到它的距离和,复杂度 O ( n 2 ) O(n^2) O(n2)
∑ ( v i × ∣ x i − x j ∣ ) , v i > v j \sum (v_{i}\times |x_{i}-x_{j}|),v_{i}>v_{j} ∑(vi×∣xi−xj∣),vi>vj
需要处理掉绝对值
∑ v i > v j , x i > x j ( v i × ( x i − x j ) ) + ∑ v i > v j , x i < x j ( v i × ( x j − x i ) ) \sum_{v_{i}>v_{j},x_{i}>x_{j}} (v_{i}\times (x_{i}-x_{j}))+\sum_{v_{i}>v_{j},x_{i}<x_{j}} (v_{i}\times (x_{j}-x_{i})) ∑vi>vj,xi>xj(vi×(xi−xj))+∑vi>vj,xi<xj(vi×(xj−xi))
每次处理的牛 i i i 与已经处理的牛 j j j 满足 v i > v j v_{i}>v_{j} vi>vj,只要知道已经处理的牛的坐标和头数即可求得音量乘积。这里用两个二维数组以坐标值为索引,维护牛的头数以及坐标和,总复杂度 O ( n l o g n ) O(nlogn) O(nlogn)。
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#define min(a,b) (((a) < (b)) ? (a) : (b))
#define max(a,b) (((a) > (b)) ? (a) : (b))
#define abs(x) ((x) < 0 ? -(x) : (x))
#define INF 0x3f3f3f3f
#define delta 0.85
#define eps 1e-5
#define PI 3.14159265358979323846
#define MAX_N 20005
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
int N;
P S[MAX_N];
int bit1[MAX_N + 1], bit2[MAX_N + 1]; // 数量, 坐标和
int sum(int *b, int i){
int s = 0;
while(i > 0){
s += b[i];
i -= i & -i;
}
return s;
}
void add(int *b, int i, int x){
while(i <= MAX_N){
b[i] += x;
i += i & -i;
}
}
int main(){
while(~scanf("%d", &N) && N){
memset(bit1, 0, sizeof(bit1));
memset(bit2, 0, sizeof(bit2));
for(int i = 0; i < N; i++) scanf("%d%d", &S[i].first, &S[i].second);
sort(S, S + N);
LL res = 0;
for(int i = 0; i < N; i++){
LL v = S[i].first, x = S[i].second;
// 处理 vj < vi, xj < xi 的情况
res += v * (sum(bit1, x) * x - sum(bit2, x));
// 处理 vj < vi, xj > xi 的情况
res += v * (sum(bit2, MAX_N) - sum(bit2, x) - (sum(bit1, MAX_N) - sum(bit1, x)) * x);
add(bit1, x, 1);
add(bit2, x, x);
}
printf("%lld\n", res);
}
return 0;
}