#include<bits/stdc++.h>
using namespace std;
#define int long long
int n, k, a[100005], dp[2][100005], val[100005], pfs[100005], trace[205][100005], pfs2[100005];
int cost(int l, int r) {
return (pfs2[r] - pfs2[l-1]) * (pfs2[n] - pfs2[r]);
//return pfs[r] - pfs[l - 1] - pfs2[l - 1] * (r - l + 1);
}
void solve(int l, int r, int opl, int opr, int k) {
int mid = (l + r) / 2, res = -1, pos;
for (int i = opl; i <= min(mid, opr); i++) if(i >= k) {
int val = dp[k&1^1][i - 1] + cost(i, mid);
if(res < val) {
res = val;
pos = i;
}
}
dp[k&1][mid] = res;
trace[k][mid] = pos - 1;
if(l < mid) solve(l, mid-1, opl, pos, k);
if(mid < r) solve(mid + 1, r, pos, opr, k);
}
signed 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];
pfs2[i] = pfs2[i - 1] + a[i];
}
for (int i = 1; i <= n; i++) {
dp[0][i] = -1;
}
for (int i = 1; i <= k; i++){
memset(dp[i%2], -1, sizeof(dp[i%2]));
solve(i, n, 1, n, i);
}
cout << dp[k%2][n] << endl;
vector<int> ans;
int p = n;
for(int i = k; i > 1; i--){
p = trace[i][p]; ans.push_back(p);
}
reverse(ans.begin(), ans.end());
for(int i : ans) cout<<i<<" ";
}
Compilation message
sequence.cpp: In function 'void solve(long long int, long long int, long long int, long long int, long long int)':
sequence.cpp:16:23: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
16 | int val = dp[k&1^1][i - 1] + cost(i, mid);
| ~^~
sequence.cpp:23:25: warning: 'pos' may be used uninitialized in this function [-Wmaybe-uninitialized]
23 | trace[k][mid] = pos - 1;
| ~~~~^~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
2392 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
2392 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
2652 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
2664 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
4700 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
4 ms |
3676 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
3 ms |
3420 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
4 ms |
3676 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
5 ms |
7852 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
4700 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
6748 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
2 ms |
2908 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
9 ms |
7004 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
10 ms |
9052 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
8 ms |
4700 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
9 ms |
4952 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
8 ms |
4956 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
2 ms |
4964 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
4 ms |
3420 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
2904 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
2 ms |
2392 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
77 ms |
18772 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
2 ms |
2396 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
52 ms |
12716 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
51 ms |
13648 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
46 ms |
14540 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
45 ms |
12372 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
44 ms |
14420 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
87 ms |
16976 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
20 ms |
8028 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
18 ms |
7852 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Runtime error |
383 ms |
131072 KB |
Execution killed with signal 9 |
| 4 |
Halted |
0 ms |
0 KB |
- |
