题目链接:点击进入
题目
题意
n 个点的有向图,边权可正可负,给你一个 d 数组,d [ i ] 表示从 1 到 i 的最短距离。让你求整个图最小的总边权和。
思路
看看样例,我们大约可以想到,相邻两个点的贡献为 0 ,只有间隔点才会产生贡献。
我们对 d 数组排序,我们观察产生贡献都是哪些,d [ 3 ] - d [ 1 ], d [ 4 ] - d [ 1 ] ,d [ 4 ] - d [ 2 ] ,…
,总结一下,就是对于每个 i ( i >= 3 ) ,对答案的贡献就是 ( i - 2 ) * a [ i ] - sum [ i - 2 ] ( sum 维护前缀和 ),最后得到的答案取负,就是题目要求的答案;
代码
// Problem: C. Great Graphs
// Contest: Codeforces - Codeforces Round #728 (Div. 2)
// URL: https://codeforces.com/contest/1541/problem/C
// Memory Limit: 256 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)
//#pragma GCC optimize(3)//O3
//#pragma GCC optimize(2)//O2
#include<iostream>
#include<string>
#include<map>
#include<set>
//#include<unordered_map>
#include<queue>
#include<cstdio>
#include<vector>
#include<cstring>
#include<stack>
#include<algorithm>
#include<iomanip>
#include<cmath>
#include<fstream>
#define X first
#define Y second
#define best 131
#define INF 0x3f3f3f3f3f3f3f3f
#define pii pair<int,int>
#define lowbit(x) x & -x
#define inf 0x3f3f3f3f
#define int long long
//#define double long double
//#define rep(i,x,y) for(register int i = x; i <= y;++i)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const double pai=acos(-1.0);
const int maxn=1e6+10;
const int mod=998244353;
const double eps=1e-9;
const int N=5e3+10;
/*--------------------------------------------*/
inline int read()
{
int k = 0, f = 1 ;
char c = getchar() ;
while(!isdigit(c)){if(c == '-') f = -1 ;c = getchar() ;}
while(isdigit(c)) k = (k << 1) + (k << 3) + c - 48 ,c = getchar() ;
return k * f ;
}
/*--------------------------------------------*/
int t,n,a[maxn],sum[maxn];
signed main()
{
scanf("%lld",&t);
while(t--)
{
scanf("%lld",&n);
for(int i=1;i<=n;i++) scanf("%lld",&a[i]);
sort(a+1,a+n+1);
for(int i=1;i<=n;i++) sum[i]=sum[i-1]+a[i];
int ans=0;
for(int i=3;i<=n;i++)
ans+=(i-2)*a[i]-sum[i-2];
printf("%lld\n",-ans);
}
return 0;
}