# POJ 2231 Moo Volume

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

Time Limit: 1000MS   Memory Limit: 65536K

Description

Farmer John has received a noise complaint from his neighbor, Farmer Bob, stating that his cows are making too much noise.

FJ's N cows (1 <= N <= 10,000) all graze at various locations on a long one-dimensional pasture. The cows are very chatty animals. Every pair of cows simultaneously carries on a conversation (so every cow is simultaneously MOOing at all of the N-1 other cows). When cow i MOOs at cow j, the volume of this MOO must be equal to the distance between i and j, in order for j to be able to hear the MOO at all. Please help FJ compute the total volume of sound being generated by all N*(N-1) simultaneous MOOing sessions.

Input

* Line 1: N

* Lines 2..N+1: The location of each cow (in the range 0..1,000,000,000).

Output

There are five cows at locations 1, 5, 3, 2, and 4.

Sample Input

5
1
5
3
2
4

Sample Output

40

Hint

INPUT DETAILS:

There are five cows at locations 1, 5, 3, 2, and 4.

OUTPUT DETAILS:

Cow at 1 contributes 1+2+3+4=10, cow at 5 contributes 4+3+2+1=10, cow at 3 contributes 2+1+1+2=6, cow at 2 contributes 1+1+2+3=7, and cow at 4 contributes 3+2+1+1=7. The total volume is (10+10+6+7+7) = 40.

#include
#include
#include
using namespace std;
const int inf=1e4+10;

long long a[inf],f[inf];    //a数组存储每头牛的坐标，f数组存储每头牛声音的大小
int n;
long long ans=0;

int main(){
cin>>n;
for (int i=1;i<=n;i++)	scanf("%d",&a[i]);

sort(a+1,a+n+1);

for (int i=2;i<=n;i++) f[1]+=a[i]-a[1];     //将f[1]初始化
ans=f[1];

for (int i=2;i<=n;i++){
f[i]= f[i-1] - ((n-i)*(a[i]-a[i-1])) + (i-2)*(a[i]-a[i-1]);
ans+=f[i];
}

cout<

06-11

10-13 178

02-24 577

06-06 699

01-15 989

03-24 1675

04-30 2513

01-20 806

03-17 141

#### 解题报告 Moo Volume

©️2020 CSDN 皮肤主题: 大白 设计师: CSDN官方博客

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、C币套餐、付费专栏及课程。