#include <bits/stdc++.h>
using namespace std;
struct Data
{
int64_t a,b;
int id;
};
typedef pair<int64_t,int> ii;
int n,k,top,pointer,Trace[205][100005];
int64_t a[100005],f[100005];
Data S[100005];
bool Check(Data x1,Data x2,Data x3)
{
///Intersection(x1,x2)=(x1.b-x2.b)/(x2.a-x1.a)
///Intersection(x1,x3)=(x1.b-x3.b)/(x3.a-x1.a)
return (x1.b-x3.b)*(x2.a-x1.a)<=(x1.b-x2.b)*(x3.a-x1.a);
}
void Update(int64_t x,int64_t y,int id)
{
while(top>=2&&Check(S[top-1],S[top],{x,y,id})==true)
top--;
S[++top]={x,y,id};
}
ii Query(int64_t x)
{
pointer=min(pointer,top);
while(pointer<top&&S[pointer+1].a*x+S[pointer+1].b<=S[pointer].a*x+S[pointer].b)
pointer++;
return ii(S[pointer].a*x+S[pointer].b,S[pointer].id);
}
void Process(int kk)
{
top=0;
pointer=1;
Update(0,0,0);
for(int i=1;i<=n;i++)
{
ii tmp=Query(a[i]);
Update(-a[i],a[i]*a[i]-f[i],i);
f[i]=-tmp.first;
Trace[kk][i]=tmp.second;
}
}
int main()
{
ios_base::sync_with_stdio(false);
//freopen("TEST.INP","r",stdin);
cin>>n>>k;
for(int i=1;i<=n;i++)
{
cin>>a[i];
a[i]+=a[i-1];
}
for(int i=1;i<=k;i++)
Process(i);
cout<<f[n]<<"\n";
while(k>0)
{
n=Trace[k][n];
k--;
cout<<n<<' ';
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
2 ms |
488 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
2 ms |
488 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
2 ms |
488 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
2 ms |
640 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
2 ms |
640 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
2 ms |
640 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
2 ms |
640 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
2 ms |
640 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
2 ms |
640 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
2 ms |
640 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
2 ms |
724 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
2 ms |
724 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
2 ms |
724 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
2 ms |
724 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
2 ms |
724 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
2 ms |
724 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
724 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
2 ms |
724 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
2 ms |
892 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
2 ms |
892 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
2 ms |
892 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
2 ms |
892 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
2 ms |
892 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
2 ms |
892 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
2 ms |
892 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
2 ms |
892 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
892 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
2 ms |
892 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
3 ms |
1660 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
2 ms |
1660 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
3 ms |
1660 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
3 ms |
1660 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
3 ms |
1660 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
2 ms |
1660 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
2 ms |
1660 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
2 ms |
1660 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
1660 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
2 ms |
1660 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
6 ms |
2428 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
2 ms |
2428 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
7 ms |
2428 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
9 ms |
2428 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
8 ms |
2428 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
6 ms |
2428 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
3 ms |
2428 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
4 ms |
2428 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
2428 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
3 ms |
2428 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
37 ms |
9724 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
4 ms |
9724 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
43 ms |
9724 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
35 ms |
9724 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
40 ms |
9724 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
28 ms |
9724 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
31 ms |
9724 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
39 ms |
9724 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
19 ms |
9724 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
18 ms |
9724 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
320 ms |
82812 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
19 ms |
82812 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
616 ms |
83200 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
346 ms |
83200 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
390 ms |
83200 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
260 ms |
83200 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
286 ms |
83200 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
352 ms |
83200 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
