#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <array>
#include <stack>
#include <queue>
#include <random>
#include <numeric>
#include <functional>
#include <chrono>
#include <utility>
#include <iomanip>
#include <assert.h>
using namespace std;
void dbg_out() { cerr << endl; }
template<typename Head, typename... Tail>
void dbg_out(Head H, Tail... T) { cerr << ' ' << H; dbg_out(T...); }
#define dbg(...) cerr << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#define rng_init mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#define rng_seed(x) mt19937 rng(x)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int) (x).size()
// #define int long long
using ll = long long;
const int MXN = 1e5 + 5;
const ll INF = 1e18;
int N, K;
int A[MXN], trace[205][MXN];
ll dp[2][MXN], pref[MXN];
void dnc(int l, int r, int i, int optl, int optr) {
if (l > r) return;
int cur = i & 1;
int mid = (l + r) / 2;
pair<ll, ll> best = {-INF, -INF};
for (int j = optl; j < min(mid, optr + 1); j++) {
ll new_val = dp[cur ^ 1][j] + (pref[mid] - pref[j]) * (pref[N] - pref[mid]);
if (new_val > best.first)
best = make_pair(new_val, j);
}
dp[cur][mid] = best.first;
trace[i][mid] = best.second;
dnc(l, mid - 1, i, optl, best.second);
dnc(mid + 1, r, i, best.second, optr);
}
void solve() {
cin >> N >> K;
for (int i = 1; i <= N; i++) {
cin >> A[i];
pref[i] = pref[i - 1] + A[i];
}
for (int i = 0; i < 2; i++)
for (int j = 0; j < MXN; j++)
dp[i][j] = -INF;
dp[0][0] = 0;
for (int i = 1; i <= K; i++)
dnc(i, N, i, i - 1, N - 1);
pair<ll, int> best = {-INF, -INF};
for (int j = 1; j < N; j++)
best = max(best, make_pair(dp[K & 1][j], j));
cout << best.first << "\n";
int cur_k = K;
while (cur_k && best.second) {
cout << best.second << " ";
best.second = trace[cur_k--][best.second];
}
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int TC = 1;
// cin >> TC;
while (TC--) solve();
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
1868 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
2 ms |
1868 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
1868 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
1868 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
1868 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
1868 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
1868 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
1868 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
1868 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
1868 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
1868 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 ms |
1868 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
1868 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
2 ms |
1904 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
1920 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
1868 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
1868 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
1868 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
2 ms |
1868 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
2124 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
1868 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
1868 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
1868 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
2 ms |
1996 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
1868 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
1868 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
2 ms |
1868 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
1868 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
2 ms |
1868 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
3 ms |
2892 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
1868 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
2 ms |
2636 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
3 ms |
2764 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
3 ms |
2892 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
2 ms |
2124 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
2 ms |
2000 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
2 ms |
2124 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
1868 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
2 ms |
1872 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
7 ms |
3532 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
2 ms |
1868 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
14 ms |
3508 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
9 ms |
3276 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
8 ms |
3532 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
7 ms |
3540 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
3 ms |
2260 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
5 ms |
2572 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
2124 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
3 ms |
2124 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
57 ms |
10680 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
3 ms |
2124 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
72 ms |
7140 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
68 ms |
8068 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
65 ms |
8516 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
46 ms |
7340 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
65 ms |
8004 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
94 ms |
9820 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
24 ms |
4172 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
22 ms |
4188 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
712 ms |
81740 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
20 ms |
4684 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1325 ms |
81440 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
821 ms |
57972 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
692 ms |
62272 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
518 ms |
51156 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
660 ms |
58196 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
858 ms |
73900 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
