1175D - Array Splitting(思维+后缀和)

https://codeforces.com/problemset/problem/1175/D

---

思路：看到第一眼，dp..第二反应，这复杂度能优化的？

一搜发现是个trick

来源

https://blog.csdn.net/weixin_43819762/article/details/109148973?utm_medium=distribute.pc_relevant.none-task-blog-baidujs_title-4&spm=1001.2101.3001.4242

#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=3e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn],sum[maxn];
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);
   LL n,k;cin>>n>>k;
   for(LL i=1;i<=n;i++) cin>>a[i];
   for(LL i=1;i<=n;i++){
       sum[i]=sum[i-1]+a[i];
   }
   sort(sum+1,sum+n);
   LL ans=sum[n]*k;
  /// sort(a+1,a+n);///
   for(LL i=1;i<=k-1;i++){
      ans-=sum[i];
   }
   cout<<ans<<"\n";
   return 0;
}