#include <bits/stdc++.h>
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
*/
using namespace std;
// using namespace __gnu_pbds;
using namespace chrono;
// mt19937 rng((int) std::chrono::steady_clock::now().time_since_epoch().count());
/*
template <class T> using ordered_set = tree <T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;
*/
//***************** CONSTANTS *****************
const int MXN = 100001;
const int MXK = 201;
const int64_t INF = 1'000'000'000'000'000'000;
//***************** GLOBAL VARIABLES *****************
int64_t dp[2][MXN];
int parent[MXK][MXN];
int64_t pref[MXN];
int N, K;
//***************** AUXILIARY STRUCTS *****************
//***************** MAIN BODY *****************
void dnc(int l, int r, int t, int optl, int optr, int row){
if(l > r)
return;
int mid = (l + r) >> 1;
pair<int64_t, int> best = {-1, -1};
for(int i = optl; i < min(mid, optr + 1); i++){
int64_t val = dp[t ^ 1][i] + (pref[mid] - pref[i]) * (pref[N] - pref[mid]);
if(val > best.first)
best = {val, i};
}
dp[t][mid] = best.first;
parent[row][mid] = best.second;
dnc(l, mid - 1, t, optl, best.second, row);
dnc(mid + 1, r, t, best.second, optr, row);
}
void solve(){
cin >> N >> K;
for(int i = 1; i <= N; i++){
cin >> pref[i];
pref[i] += pref[i-1];
}
for(int i = 0; i <= N; i++)
dp[0][i] = dp[1][i] = -INF;
dp[0][0] = 0;
for(int i = 1; i <= K; i++)
dnc(i, N - 1, i & 1, i - 1, N - 1, i);
pair<int64_t, int> ans = {-1, -1};
for(int i = 1; i < N; i++)
ans = max(ans, {dp[K & 1][i], i});
cout << ans.first << '\n';
for(int i = K, var = ans.second; i; var = parent[i][var], --i)
cout << var << ' ';
}
//***************** *****************
int32_t main(){
ios_base::sync_with_stdio(NULL);
cin.tie(NULL);
#ifdef LOCAL
auto begin = high_resolution_clock::now();
#endif
int tc = 1;
// cin >> tc;
for (int t = 0; t < tc; t++)
solve();
#ifdef LOCAL
auto end = high_resolution_clock::now();
cout << fixed << setprecision(4);
cout << "Execution Time: " << duration_cast<duration<double>>(end - begin).count() << "seconds" << endl;
#endif
return 0;
}
/*
If code gives a WA, check for the following :
1. I/O format
2. Are you clearing all global variables in between tests if multitests are a thing
3. Can you definitively prove the logic
*/
| # |
결과 |
실행 시간 |
메모리 |
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 |
0 ms |
332 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
0 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 |
0 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 |
0 ms |
332 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
0 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 |
0 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 |
0 ms |
332 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 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 |
460 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
0 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 |
332 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
0 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 |
0 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 |
0 ms |
332 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
1 ms |
972 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
2 ms |
1228 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
1 ms |
1356 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
460 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 |
1868 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 |
1868 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
8 ms |
1740 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
7 ms |
1940 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
5 ms |
1960 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
2 ms |
588 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 |
588 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
3 ms |
588 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
54 ms |
9172 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
2 ms |
588 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
73 ms |
5772 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
69 ms |
6648 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
62 ms |
6960 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
44 ms |
5828 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
70 ms |
6640 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
90 ms |
8352 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
24 ms |
3840 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
24 ms |
3736 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
616 ms |
81004 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
21 ms |
3736 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1370 ms |
80892 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
862 ms |
57632 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
698 ms |
61828 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
500 ms |
50816 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
671 ms |
57804 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
873 ms |
73436 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
