#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define pii pair<LL,LL>
#define LL long long
#define st first
#define nd second
#define endl '\n'
using namespace std;
const int MAXN=100005,MAXK=201;
LL n,k,sum[MAXN],t,pnt,val[2][MAXN],top;
int used[MAXN][MAXK];
pair<pii,int> line[MAXN];
double inter(pii a,pii b) {
if(a.st==b.st)
return -1e9;
return 1.0*(b.nd-a.nd)/(a.st-b.st);
}
void upd(LL val) {
while(pnt+1<top&&inter(line[pnt].st,line[pnt+1].st)<=1.0*val)
++pnt;
}
void add(pii ll,int y) {
while(top>=2&&inter(line[top-1].st,line[top-2].st)>=inter(ll,line[top-1].st))
--top;
line[top++]=mp(ll,y);
pnt=min(pnt,top-1);
}
int main() {
scanf("%lld %lld",&n,&k);
for(int i=1;i<=n;++i) {
scanf("%lld",&t);
sum[i]=sum[i-1]+t;
}
for(int j=1;j<=k;++j) {
int cur=j&1,old=cur^1;
pnt=top=0;
add(mp(sum[j],-sum[j]*sum[j]+val[old][j]),j);
for(int i=j+1;i<=n;++i) {
upd(sum[i]);
val[cur][i]=line[pnt].st.st*sum[i]+line[pnt].st.nd;
//cout<<j<<" "<<i<<" "<<val[cur][i]<<endl;
used[i][j]=line[pnt].nd;
add(mp(sum[i],-sum[i]*sum[i]+val[old][i]),i);
}
}
printf("%lld\n",val[k&1][n]);
int cur=n;
for(int i=k;i>=1;--i) {
cur=used[cur][i];
printf("%lld ",cur);
}
printf("\n");
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:63:21: warning: format '%lld' expects argument of type 'long long int', but argument 2 has type 'int' [-Wformat=]
printf("%lld ",cur);
^
sequence.cpp:42:26: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld %lld",&n,&k);
^
sequence.cpp:44:19: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld",&t);
^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
85228 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
85228 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
85228 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
0 ms |
85228 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
85228 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
85228 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
0 ms |
85228 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
85228 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
85228 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
0 ms |
85228 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
0 ms |
85228 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
85228 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
0 ms |
85228 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
0 ms |
85228 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
0 ms |
85228 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
0 ms |
85228 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
0 ms |
85228 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
85228 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
85228 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
0 ms |
85228 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
0 ms |
85228 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
0 ms |
85228 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
0 ms |
85228 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
0 ms |
85228 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
0 ms |
85228 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
0 ms |
85228 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
0 ms |
85228 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
85228 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
0 ms |
85228 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
0 ms |
85228 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
0 ms |
85228 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
0 ms |
85228 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
0 ms |
85228 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
0 ms |
85228 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
0 ms |
85228 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
0 ms |
85228 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
0 ms |
85228 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
85228 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
0 ms |
85228 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
3 ms |
85228 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
0 ms |
85228 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
6 ms |
85228 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
3 ms |
85228 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
6 ms |
85228 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
3 ms |
85228 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
0 ms |
85228 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
3 ms |
85228 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
85228 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
0 ms |
85228 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
79 ms |
85228 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
3 ms |
85228 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
53 ms |
85228 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
59 ms |
85228 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
66 ms |
85228 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
56 ms |
85228 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
59 ms |
85228 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
73 ms |
85228 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
56 ms |
85228 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
49 ms |
85228 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
1796 ms |
85228 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
53 ms |
85228 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1559 ms |
85228 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
1293 ms |
85228 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
993 ms |
85228 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
1729 ms |
85228 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
1116 ms |
85228 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
1133 ms |
85228 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
