1679: [Usaco2005 Jan]Moo Volume 牛的呼声 (差分序列)

最新推荐文章于 2019-02-19 15:03:34 发布

ndsffx501ccy

最新推荐文章于 2019-02-19 15:03:34 发布

阅读量736

点赞数

分类专栏：其他

本文链接：https://blog.csdn.net/ndsffx501ccy/article/details/37407369

版权

其他专栏收录该内容

42 篇文章 0 订阅

订阅专栏

#include<algorithm>  
#include<iostream>  
#include<cstring>  
#include<cstdio>  
#define inf 0x7fffffff  
#define MAXN 100001
using namespace std;

inline int read() {
    int x = 0, f = 1;
    char ch = getchar();
    while (ch < '0' || ch > '9') {
        if (ch == '-')f = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9') {
        x = x * 10 + ch - '0';
        ch = getchar();
    }
    return x*f;
}
int n, a[10001], s[10001];
long long ans;

int main() {
    n = read();
    for (int i = 1; i <= n; i++)
        a[i] = read();
    sort(a + 1, a + n + 1);
    for (int i = 1; i < n; i++)
        s[i] = a[i + 1] - a[i];
    for (int i = 1; i < n; i++)
        ans += (long long) i * (n - i) * s[i];
    printf("%lld", 2 * ans);
    return 0;
}