题意:主人公又是Farmer John’s,他有n头牛,参加完party后每头牛的听力值变成v后,每头牛还有一个位置属性。并且任意两头牛位置之差乘以他们当中v大的哪一个作为一个volume,问n头牛两两之间所有volume之和是。
思路:也就是 给你n个数,n的范围是20000,然后算任意两两数之差的绝对值之和,n^2的算法明显TLE。这里,由前面做过的题目,树状数组可以求对于当前第i个数,前面比它小的数的个数num,和比这个数小的出现过所有数值之和sum,所有数值和all_sum,这里我们假设求Xi这个数与其他数差的绝对值之和,分先求与比它小的数差绝对值之和:Xi*num-sum 再求比这个数大的数与这个数差的绝对值之和:all_sum-sum-(i-num-1).
#include <fstream>
#include <iostream>
#include <string>
#include <cstring>
#include <complex>
#include <math.h>
#include <set>
#include <vector>
#include <map>
#include <queue>
#include <stdio.h>
#include <stack>
#include <algorithm>
#include <list>
#include <ctime>
#include <ctime>
#include <assert.h>
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define eps 1e-8
#define M_PI 3.141592653589793
typedef long long ll;
const ll mod=1000000007;
const int inf=0x7fffffff;
ll powmod(ll a,ll b) {ll res=1;a%=mod;for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
using namespace std;
struct node
{
int v,x;
bool operator <(const node &a)const
{
return v<a.v;
}
}a[20010];
ll tree1[20010],tree2[20010];
ll lowbit(int x) {return x&(-x);}
void update_num(int x)
{
while(x<=20005){
tree1[x]+=1;
x+=lowbit(x);
}
}
void update_sum(int x,int num)
{
while(x<=20005){
tree2[x]+=num;
x+=lowbit(x);
}
}
ll get_num(int i)
{
ll sum=0;
while(i>0){
sum+=tree1[i];
i-=lowbit(i);
}
return sum;
}
ll get_sum(int i)
{
ll sum=0;
while(i>0){
sum+=tree2[i];
i-=lowbit(i);
}
return sum;
}
int main()
{
int n;
while(cin>>n){
memset(tree1,0,sizeof(tree1));
memset(tree2,0,sizeof(tree2));
for(int i=0;i<n;i++) cin>>a[i].v>>a[i].x;
sort(a,a+n);
ll ans=0;
for(int i=0;i<n;i++){
ll all_sum=get_sum(20005);
ll num=get_num(a[i].x); update_num(a[i].x);
ll sum=get_sum(a[i].x); update_sum(a[i].x,a[i].x);
// cout<<a[i].x<<num<<sum<<endl;
ans+=a[i].v*(a[i].x*num-sum);
ans+=(all_sum-sum-(i+1-num-1)*a[i].x)*a[i].v;
}
cout<<ans<<endl;
}
}