#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int mxN=1e5;
int n, k, prv[201][mxN+1], qh, qt;
ll ps[mxN+1], dp[2][mxN+1], a[mxN+1], b[mxN+1], c[mxN+1];
inline void al(ll ai, ll bi, ll ci) {
if(qt-qh>=1&&a[qt-1]==ai) {
if(bi<b[qt-1])
--qt;
else
return;
}
while(qt-qh>=2&&(b[qt-1]-b[qt-2])/(a[qt-2]-a[qt-1])>=(bi-b[qt-1])/(a[qt-1]-ai))
--qt;
a[qt]=ai;
b[qt]=bi;
c[qt]=ci;
++qt;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> k;
for(int i=0; i<n; ++i)
cin >> ps[i+1], ps[i+1]+=ps[i];
for(int i=1; i<=n; ++i)
dp[1][i]=1e18;
for(int i=0; i<=k; ++i) {
qh=qt=0;
al(-2*ps[i], ps[i]*ps[i]+dp[i&1^1][i], i);
for(int j=i+1; j<=n; ++j) {
while(qt-qh>=2&&a[qh+1]*ps[j]+b[qh+1]<=a[qh]*ps[j]+b[qh])
++qh;
dp[i&1][j]=ps[j]*ps[j]+a[qh]*ps[j]+b[qh];
prv[i][j]=c[qh];
al(-2*ps[j], ps[j]*ps[j]+dp[i&1^1][j], j);
}
}
cout << (ps[n]*ps[n]-dp[k&1][n])/2 << "\n";
for(int i=k, j=prv[k][n]; i; --i, j=prv[i][j])
cout << j << " ";
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:36:32: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
al(-2*ps[i], ps[i]*ps[i]+dp[i&1^1][i], i);
~^~
sequence.cpp:42:33: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
al(-2*ps[j], ps[j]*ps[j]+dp[i&1^1][j], j);
~^~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
380 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 |
584 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
2 ms |
644 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
2 ms |
644 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
2 ms |
724 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
2 ms |
724 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
2 ms |
740 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
2 ms |
740 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
2 ms |
752 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
2 ms |
752 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
2 ms |
752 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
2 ms |
752 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
2 ms |
752 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
2 ms |
752 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
2 ms |
752 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
752 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
2 ms |
752 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
2 ms |
956 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
2 ms |
956 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
2 ms |
956 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
2 ms |
956 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
2 ms |
956 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
2 ms |
956 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
2 ms |
956 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
2 ms |
956 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
956 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
2 ms |
956 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 |
10 ms |
2300 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
2 ms |
2300 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
10 ms |
2300 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
9 ms |
2300 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
11 ms |
2428 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
9 ms |
2428 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
4 ms |
2428 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
5 ms |
2428 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
2428 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
4 ms |
2428 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
83 ms |
9904 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
5 ms |
9904 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
56 ms |
9904 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
64 ms |
9904 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
75 ms |
9904 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
57 ms |
9904 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
59 ms |
9904 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
75 ms |
9904 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
27 ms |
9904 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
26 ms |
9904 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
805 ms |
84280 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
30 ms |
84280 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
892 ms |
84280 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
655 ms |
84280 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
751 ms |
84280 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
573 ms |
84280 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
557 ms |
84280 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
707 ms |
84280 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
