#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
typedef long long ll;
typedef pair<int,int> ii;
const int N = 1e5;
const int K = 2e2;
const ll INF = 1e18;
int n, k;
int a[N+2];
int bt[K+2][N+2];
ll sum[N+2];
ll dp[2][N+2];
ll cost(int l, int r) {
return (sum[r]-sum[l-1])*sum[l-1];
}
void compute(int id, int l, int r, int x, int y) {
if (l > r) return;
int mid = (l+r)/2, opt = -1;
dp[id&1][mid] = -INF;
for (int i = x; i <= min(y,mid); i++) {
if (dp[id&1][mid] < dp[id&1^1][i-1]+cost(i,mid)) {
dp[id&1][mid] = dp[id&1^1][i-1]+cost(i,mid);
bt[id][mid] = i-1;
opt = i;
}
}
compute(id,l,mid-1,x,opt); compute(id,mid+1,r,opt,y);
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n >> k; k++;
for (int i = 1; i <= n; i++) {
cin >> a[i];
sum[i] = sum[i-1]+a[i];
}
for (int i = 2; i <= k; i++) compute(i,i,n,i,n);
vector<int> res;
for (int i = n, j = k; i >= 1; i = bt[j][i], j--) {
res.push_back(bt[j][i]);
}
sort(res.begin(),res.end());
cout << dp[k&1][n] << '\n';
for (int i = 1; i < res.size(); i++) {
if (i != 1) cout << ' ';
cout << res[i];
}
cout << '\n';
return 0;
}
/*
7 3
4 1 3 4 0 2 3
*/
Compilation message
sequence.cpp: In function 'void compute(int, int, int, int, int)':
sequence.cpp:28:34: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
28 | if (dp[id&1][mid] < dp[id&1^1][i-1]+cost(i,mid)) {
| ~~^~
sequence.cpp:29:34: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
29 | dp[id&1][mid] = dp[id&1^1][i-1]+cost(i,mid);
| ~~^~
sequence.cpp: In function 'int main()':
sequence.cpp:51:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
51 | for (int i = 1; i < res.size(); i++) {
| ~~^~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
620 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
2 ms |
1388 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
2 ms |
1132 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
2 ms |
1260 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
2 ms |
1388 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
620 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
2 ms |
620 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
7 ms |
2028 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
13 ms |
2156 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
9 ms |
1772 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
9 ms |
2028 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
8 ms |
2028 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
3 ms |
748 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
5 ms |
1132 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
748 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
3 ms |
768 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
75 ms |
9452 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
3 ms |
876 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
82 ms |
5996 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
82 ms |
6744 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
72 ms |
7276 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
50 ms |
5996 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
72 ms |
6764 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
97 ms |
8556 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
28 ms |
4332 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
29 ms |
4460 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
765 ms |
81900 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
25 ms |
4864 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1492 ms |
81772 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
916 ms |
58220 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
773 ms |
62316 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
563 ms |
51180 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
759 ms |
58372 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
974 ms |
74092 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
