1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
|
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<queue>
#include<map>
#include<stack>
#include<cmath>
#include<set>
#include<bitset>
#include<complex>
#include<cstdlib>
#include<assert.h>
#define inc(i,l,r) for(int i=l;i<=r;i++)
#define dec(i,l,r) for(int i=l;i>=r;i--)
#define link(x) for(edge *j=h[x];j;j=j->next)
#define mem(a) memset(a,0,sizeof(a))
#define ll long long
#define eps 1e-8
#define succ(x) (1<<x)
#define lowbit(x) (x&(-x))
#define mid (x+y>>1)
#define sqr(x) ((x)*(x))
#define NM 100005
#define nm 2005
using namespace std;
const double pi=acos(-1);
const ll inf=1e18;
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-'0',ch=getchar();
return f*x;
}
int n,m,p,q[NM],qh,qt;
ll d[NM],g[NM],ans,a[NM],b[NM];
double slope(int x,int y){return 1.0*(g[x]-b[x]-g[y]+b[y])/(a[x]-a[y]);}
int main(){
int _=read();while(_--){
n=read();m=read()+1;p=read();
inc(i,1,n)a[i]=read(),b[i]=a[i]*(n-i+1);
sort(b+1,b+1+n,greater<ll>());
ans=0;
inc(i,1,p)ans+=b[i];
inc(i,1,n)b[i]=i*a[i]+b[i-1],a[i]+=a[i-1];
inc(i,1,n)d[i]=-inf;
inc(j,1,m){
inc(i,1,n)g[i]=d[i];g[0]=0;
q[qh=qt=1]=0;
inc(i,1,n){
while(qh<qt&&slope(q[qh],q[qh+1])>-i-1)qh++;
d[i]=g[q[qh]]-(i+1)*(a[i]-a[q[qh]])+b[i]-b[q[qh]];
while(qh<qt&&slope(q[qt-1],q[qt])<slope(q[qt],i))qt--;
q[++qt]=i;
}
}
ans+=d[n];
printf("%lld\n",ans);
}
return 0;
}
|
