#include <bits/stdc++.h>
using namespace std;
mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());
const int N = 1e5 + 5, K = 205;
long long dp[2][N], a[N];
int comeFrom[K][N];
int n, k;
void dnc(int l, int r, int col, int bestL, int bestR) {
if(l > r) {
return;
}
int mid = (l + r) >> 1;
int pos = col & 1;
pair<long long, long long> ans = {-1, -1};
for(int i = bestL; i < min(mid, bestR + 1); i++) {
long long val = dp[1 - pos][i] + (a[n] - a[mid]) * (a[mid] - a[i]);
if(val > ans.first) {
ans = {val, i};
}
}
dp[pos][mid] = ans.first;
//cout << "col = " << col << ", mid = " << mid << ", ans.first = " << ans.first << "\n";
comeFrom[col][mid] = ans.second;
dnc(l, mid - 1, col, bestL, ans.second);
dnc(mid + 1, r, col, ans.second, bestR);
}
void Solve() {
cin >> n >> k;
for(int i = 1; i <= n; i++) {
cin >> a[i];
a[i] += a[i - 1];
}
for(int j = 0; j <= n; j++) {
for(int i = 0; i <= k; i++) {
comeFrom[i][j] = -1;
}
dp[0][j] = -1;
dp[1][j] = -1;
}
dp[0][0] = 0;
for(int i = 1; i <= k; i++) {
dnc(i, n, i, i - 1, n - 1);
}
pair<long long, int> ans = {-1, -1};
for(int i = 1; i <= n; i++) {
if(ans.first < dp[k & 1][i]) {
ans = {dp[k & 1][i], i};
}
}
cout << ans.first << "\n";
while(k != 0 && ans.second != -1) {
cout << ans.second << " ";
ans.second = comeFrom[k--][ans.second];
}
cout << "\n";
}
int32_t main() {
auto begin = std::chrono::high_resolution_clock::now();
ios_base::sync_with_stdio(0);
cin.tie(0);
int t = 1;
//cin >> t;
while(t--) {
Solve();
}
auto end = std::chrono::high_resolution_clock::now();
auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n";
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
588 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
1 ms |
1356 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
2 ms |
1100 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
2 ms |
1228 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
2 ms |
1356 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
588 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
1 ms |
588 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
6 ms |
2092 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
10 ms |
1996 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
10 ms |
1740 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
7 ms |
2108 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
5 ms |
1996 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
2 ms |
716 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
4 ms |
972 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
3 ms |
716 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
2 ms |
716 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
73 ms |
9292 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
2 ms |
716 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
74 ms |
5836 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
72 ms |
6744 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
69 ms |
7116 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
42 ms |
5836 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
63 ms |
6732 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
85 ms |
8396 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
25 ms |
4172 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
25 ms |
4176 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
720 ms |
81836 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
21 ms |
4700 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1420 ms |
81524 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
893 ms |
58040 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
696 ms |
62244 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
480 ms |
51168 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
677 ms |
58188 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
929 ms |
73848 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
