#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> ii;
const int N = 1e5 + 5;
const int M = 205;
int a[N],lst,n,k,from[N][M];
ll pre[N],dp[N][2];
ll get(int l,int r) {
return pre[r] - pre[l - 1];
}
void f(int l,int r,int optl,int optr) {
if (l > r || optl > optr)
return;
int mid = (l + r) / 2;
int new_opt = mid;
for (int i = max(mid + 1,optl) ; i <= optr ; i++) {
if (dp[mid][0] < dp[i][1] + get(mid, i - 1) * get(i,n)) {
dp[mid][0] = dp[i][1] + get(mid,i - 1) * get(i,n);
new_opt = i;
}
}
from[mid][lst] = new_opt;
f(l,mid - 1,optl,new_opt);
f(mid + 1,r,new_opt,optr);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
cin >> n >> k;
for (int i = 1 ; i <= n ; i++) {
cin >> a[i];
pre[i] = pre[i - 1] + a[i];
}
for (int i = 1 ; i <= k ; i++) {
lst = i;
for (int j = 1 ; j <= n ; j++) {
dp[j][1] = dp[j][0];
dp[j][0] = 0;
}
f(1,n,1,n);
}
cout << dp[1][0] << "\n";
for (int i = 1 , go = 1; i <= k ; i++) {
if (from[go][lst] == 1)
from[go][lst] = 2;
cout << from[go][lst] - 1 << " ";
go = from[go][lst--];
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
2 ms |
440 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
2 ms |
440 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
2 ms |
496 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
2 ms |
532 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
2 ms |
532 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
2 ms |
532 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
2 ms |
660 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
2 ms |
660 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
2 ms |
660 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
2 ms |
660 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
2 ms |
660 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
2 ms |
660 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
2 ms |
660 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
2 ms |
660 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
2 ms |
660 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
2 ms |
660 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
660 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
2 ms |
660 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
2 ms |
660 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
2 ms |
660 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
2 ms |
704 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
2 ms |
704 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
2 ms |
704 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
2 ms |
704 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
2 ms |
704 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
2 ms |
704 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
736 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
2 ms |
736 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
3 ms |
736 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
2 ms |
736 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
3 ms |
736 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
3 ms |
740 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
3 ms |
740 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
2 ms |
788 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
2 ms |
788 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
2 ms |
788 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
1376 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
3 ms |
1376 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
9 ms |
1376 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
3 ms |
1376 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
11 ms |
1376 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
9 ms |
1376 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
10 ms |
1376 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
8 ms |
1376 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
4 ms |
1388 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
7 ms |
1388 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
11 ms |
8968 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
11 ms |
8968 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
97 ms |
8968 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
10 ms |
8968 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
85 ms |
9084 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
98 ms |
9084 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
84 ms |
9084 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
68 ms |
9084 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
83 ms |
9084 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
106 ms |
9084 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
111 ms |
83748 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
107 ms |
83748 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
1400 ms |
83748 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
107 ms |
83748 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1803 ms |
83748 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
1511 ms |
83748 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
1077 ms |
83748 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
1091 ms |
83832 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
1094 ms |
83832 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
1365 ms |
83832 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
