poj——2231——Moo Volume

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

注意不要超时

#include <iostream>
#include <cstring>
#include <iomanip>
using namespace std;

int n;
long long  a[10005];
long long sum;
long long dp[10005];

int main()
{
    while (cin>>n)
    {
        for (int i=1;i<=n;i++)
            cin>>a[i];
        sort(a+1,a+n+1);
        dp[1]=0;
        for (int i=2;i<=n;i++)
        {
            dp[i]=dp[i-1]+(a[i]-a[i-1])*(i-1);
            sum+=dp[i];
        }
        dp[n]=0;
        for (int i=n-1;i>=1;i--)
        {
            dp[i]=dp[i+1]+(a[i+1]-a[i])*(n-i);
            sum+=dp[i];
        }
        cout<<sum<<endl;

    }
    return 0;
}