#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5, K = 201;
int a[N], par[N][K], lvl;
long long dp[N][2], C[N], ps[N];
long long Cost(int l, int r) {return C[r] - C[l - 1] - (ps[r] - ps[l - 1]) * ps[l - 1];}
void Solve(int s, int e, int l, int r) {
if (s == e) return ;
int mid = (s+e)>>1, pos = l;
dp[mid][lvl&1] = dp[l - 1][lvl&1^1] + Cost(l, mid);
for (int i = l + 1; i <= min(mid, r); i++)
if (dp[i - 1][lvl&1^1] + Cost(i, mid) <= dp[mid][lvl&1]) dp[mid][lvl&1] = dp[i - 1][lvl&1^1] + Cost(i, mid), pos = i;
par[mid][lvl] = pos - 1;
Solve(s, mid, l, pos), Solve(mid + 1, e, pos, r);
}
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n, k; cin >> n >> k;
for (int i = 1; i <= n; i++) cin >> a[i], dp[i][0] = C[i] = C[i - 1] + a[i] * ps[i - 1], ps[i] = ps[i - 1] + a[i];
for (lvl = 1; lvl <= k; lvl++) Solve(1, n + 1, 1, n);
cout << C[n] - dp[n][k&1] << "\n";
vector <int> ans;
while (par[n][k]) ans.push_back(n = par[n][k]), k--;
reverse(ans.begin(), ans.end());
for (int i : ans) cout << i << " ";
cout << "\n";
return 0;
}
Compilation message
sequence.cpp: In function 'void Solve(int, int, int, int)':
sequence.cpp:12:35: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
dp[mid][lvl&1] = dp[l - 1][lvl&1^1] + Cost(l, mid);
~~~^~
sequence.cpp:14:26: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
if (dp[i - 1][lvl&1^1] + Cost(i, mid) <= dp[mid][lvl&1]) dp[mid][lvl&1] = dp[i - 1][lvl&1^1] + Cost(i, mid), pos = i;
~~~^~
sequence.cpp:14:96: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
if (dp[i - 1][lvl&1^1] + Cost(i, mid) <= dp[mid][lvl&1]) dp[mid][lvl&1] = dp[i - 1][lvl&1^1] + Cost(i, mid), pos = i;
~~~^~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
5 ms |
256 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
4 ms |
256 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
4 ms |
512 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
6 ms |
512 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
6 ms |
512 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
5 ms |
1152 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
5 ms |
1152 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
11 ms |
1152 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
5 ms |
1152 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
12 ms |
1152 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
11 ms |
1152 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
12 ms |
1152 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
11 ms |
1152 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
6 ms |
1152 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
8 ms |
1152 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
10 ms |
8576 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
11 ms |
8576 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
84 ms |
8628 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
10 ms |
8576 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
67 ms |
8576 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
65 ms |
8576 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
81 ms |
8576 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
60 ms |
8704 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
70 ms |
8576 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
81 ms |
8576 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
69 ms |
82552 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
68 ms |
82552 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
1528 ms |
82580 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
68 ms |
82552 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1602 ms |
82604 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
1063 ms |
82552 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
1181 ms |
82680 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
962 ms |
82552 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
1131 ms |
82572 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
1379 ms |
82680 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
