#include <bits/stdc++.h>
#define db long long
#define N 10002
using namespace std;
struct pt { db A,B; int vt; };
struct ps { long long tu,mau; };
ps giao(pt x,pt y)
{
long long tu=y.B-x.B,mau=x.A-y.A;
// if(tu==0 && mau==0) cerr<<1<<'\n';
if(mau<0) { tu=-tu; mau=-mau; }
return { tu,mau };
}
bool operator < (ps a,ps b)
{
if(a.tu<0)
{
if(b.tu>=0) return 1;
a.tu=-a.tu; b.tu=-b.tu;
//return ;
swap(a,b);
}
if(b.tu<0)
{
if(a.tu>=0) return 0;
a.tu=-a.tu; b.tu=-b.tu;
swap(a,b);
// return b<a;
}
return a.tu*b.mau<a.mau*b.tu;
}
pt st[N];
long long g[N],f[N][202];
int i,j,n,sl,top,k,tr[N][202],d[N];
int main()
{
// freopen("ntu.inp","r",stdin);
// freopen("ntu.out","w",stdout);
cin>>n>>k; k++;
memset(f,-1,sizeof(f));
f[0][0]=0;
for(i=1;i<=n;i++) { cin>>g[i]; g[i]+=g[i-1]; }
for(sl=1;sl<=k;sl++)
{
top=0; j=1;
// int ch=sl%2;
for(i=0;i<=n;i++)
{
if(top>0)
{
j=min(j,top);
while(j<top && st[j].A*g[i]+st[j].B<=st[j+1].A*g[i]+st[j+1].B) j++;
f[i][sl]=st[j].A*g[i]+st[j].B;
tr[i][sl]=st[j].vt;
//if(sl==2 && i==n) cerr<<top<<" "<<st[j].vt<<'\n';
}
if(f[i][sl-1]>-1)
{
db A=g[i],B=f[i][sl-1]-g[i]*g[i];
while(top>0 && A==st[top].A) top--;
while(top>=2 && giao({ A,B,i },st[top-1])<giao(st[top],st[top-1])) top--;
st[++top]={ A,B,i };
}
// cerr<<i<<" "<<sl-1<<" "<<top<<'\n';
// cerr<<f[i][sl]<<" "<<top<<" "<<i<<" "<<sl<<'\n';*/
// for(j=0;j<i;j++)
// if(f[j][sl-1]>-1) f[i][sl]=max(f[i][sl],f[j][sl-1]+(g[i]-g[j])*g[j]);*/
}
}
cout<<f[n][k]<<'\n';
i=n;
while(k>0)
{
d[i]=1;
i=tr[i][k]; k--;
}
for(i=1;i<n;i++)
if(d[i]==1) cout<<i<<" ";
cout<<'\n';
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
8 ms |
16084 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
8 ms |
16064 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
7 ms |
16048 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
7 ms |
16084 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
8 ms |
16084 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
7 ms |
16124 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
7 ms |
16084 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
7 ms |
16084 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
7 ms |
16048 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
7 ms |
16052 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
7 ms |
16084 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
6 ms |
16084 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
7 ms |
16084 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
7 ms |
16084 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
7 ms |
16144 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
7 ms |
16084 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
8 ms |
16084 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
7 ms |
16084 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
7 ms |
16084 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
7 ms |
16084 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
7 ms |
16084 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
7 ms |
16084 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
7 ms |
16084 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
8 ms |
16084 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
8 ms |
16084 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
7 ms |
16084 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
8 ms |
16084 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
7 ms |
16292 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
7 ms |
16212 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
7 ms |
16308 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
7 ms |
16212 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
8 ms |
16212 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
9 ms |
16212 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
10 ms |
16232 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
8 ms |
16212 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
7 ms |
16212 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
8 ms |
16212 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
7 ms |
16852 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
7 ms |
16952 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
10 ms |
16852 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
7 ms |
16852 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
14 ms |
16852 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
11 ms |
16948 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
12 ms |
16852 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
10 ms |
16852 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
11 ms |
16852 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
9 ms |
16852 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
11 ms |
24208 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
12 ms |
24224 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
40 ms |
24396 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
13 ms |
24296 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
38 ms |
24304 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
44 ms |
24288 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
42 ms |
24472 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
33 ms |
24292 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
35 ms |
24348 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
41 ms |
24332 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
31 ms |
33048 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
