#include <bits/stdc++.h>
using namespace std;
constexpr int maxn = 1e5+10, maxk = 210;
int a[maxn], suf[maxn];
int itv(int l, int r) { return suf[l] - suf[r+1]; }
long long dp[maxn][2];
int opt[maxn][maxk];
void solve(int l, int r, int l2, int r2, int k) {
if(l > r) return;
int m = (l+r) >> 1;
pair<long long, int> ans;
for(int i = min(m-1, r2); i >= l2; i--)
ans = max(ans, {dp[i][0] + 1ll * suf[m+1] * itv(i+1, m), i});
dp[m][1] = ans.first;
opt[m][k] = ans.second;
solve(l, m-1, l2, ans.second, k);
solve(m+1, r, ans.second, r2, k);
}
int main() {
int n, k; scanf("%d %d", &n, &k);
for(int i = 1; i <= n; i++)
scanf("%d", a+i);
for(int i = n; i >= 1; i--)
suf[i] = suf[i+1] + a[i];
for(int i = 1; i < n; i++)
dp[i][0] = 1ll * suf[i+1] * itv(1, i);
for(int i = 2; i <= k; i++) {
solve(1, n-1, 1, n-1, i);
for(int j = 1; j <= n; j++)
dp[j][0] = dp[j][1];
}
pair<long long, int> best;
for(int i = 1; i < n; i++)
best = max(best, {dp[i][0], i});
vector<int> ans;
int i = best.second;
for(int j = 0; j < k; j++)
ans.push_back(i), i = opt[i][k-j];
printf("%lld\n", best.first);
reverse(ans.begin(), ans.end());
for(int x : ans)
printf("%d ", x);
puts("");
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:30:17: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
30 | int n, k; scanf("%d %d", &n, &k);
| ~~~~~^~~~~~~~~~~~~~~~~
sequence.cpp:32:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
32 | scanf("%d", a+i);
| ~~~~~^~~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 108 == 108 |
2 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 999 == 999 |
3 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 0 == 0 |
4 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 1542524 == 1542524 |
5 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
6 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 1 == 1 |
7 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 1 == 1 |
8 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 1 == 1 |
9 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 100400096 == 100400096 |
10 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 900320000 == 900320000 |
11 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
12 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
13 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 140072 == 140072 |
14 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 376041456 == 376041456 |
15 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 805 == 805 |
16 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 900189994 == 900189994 |
17 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 999919994 == 999919994 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 1093956 == 1093956 |
2 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 302460000 == 302460000 |
3 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
4 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
5 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
6 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 933702 == 933702 |
7 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
8 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 687136 == 687136 |
9 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
10 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
468 KB |
contestant found the optimal answer: 610590000 == 610590000 |
2 |
Correct |
0 ms |
468 KB |
contestant found the optimal answer: 311760000 == 311760000 |
3 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 |
Correct |
0 ms |
468 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
6 |
Correct |
2 ms |
468 KB |
contestant found the optimal answer: 107630884 == 107630884 |
7 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
8 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 193556962 == 193556962 |
9 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
10 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 21503404 == 21503404 |
2 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 140412195 == 140412195 |
3 |
Correct |
6 ms |
1108 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 |
Correct |
9 ms |
1108 KB |
contestant found the optimal answer: 679388326 == 679388326 |
6 |
Correct |
8 ms |
1168 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
7 |
Correct |
7 ms |
1172 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
8 |
Correct |
6 ms |
1108 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
9 |
Correct |
2 ms |
1108 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
10 |
Correct |
4 ms |
1108 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
6 ms |
8660 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
2 |
Correct |
7 ms |
8660 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
3 |
Correct |
76 ms |
8768 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
4 |
Correct |
5 ms |
8776 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
5 |
Correct |
73 ms |
8760 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
6 |
Correct |
79 ms |
8760 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
7 |
Correct |
65 ms |
8760 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
8 |
Correct |
54 ms |
8660 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
9 |
Correct |
64 ms |
8780 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
10 |
Correct |
83 ms |
8764 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
54 ms |
84788 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
2 |
Correct |
52 ms |
84824 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
3 |
Correct |
1062 ms |
84936 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
4 |
Correct |
48 ms |
84728 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
5 |
Correct |
1494 ms |
84820 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
6 |
Correct |
984 ms |
84928 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
7 |
Correct |
883 ms |
84896 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
8 |
Correct |
707 ms |
84824 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
9 |
Correct |
895 ms |
84812 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
10 |
Correct |
1125 ms |
84764 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |