#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define ld long double
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pb push_back
#define eb emplace_back
#define F first
#define S second
#define mp make_pair
#define random mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
template <typename T> using oset = tree <pair <T, T>, null_type, less <pair <T, T>>, rb_tree_tag, tree_order_statistics_node_update>;
template <typename Container>
void Print(Container& container, int starting) {
auto Start = container.begin() + starting, End = container.end();
while (Start != End) cout << *(Start++) << " ";
cout << '\n';
}
template <typename T>
void print(T&& t) {cout << t << '\n';}
template <typename T, typename... Args>
void print(T&& t, Args&&... args) {
cout << t << " ";
print(forward<Args>(args)...);
}
const int32_t MAXN = 1e5 + 5, MAXK = 205;
int64_t a[MAXN], dp[2][MAXN], n;
int32_t par[MAXK][MAXN];
void compute(int32_t l, int32_t r, int32_t optl, int32_t optr, int32_t k)
{
if (l > r) return;
int32_t mid = (l + r) >> 1, row = k & 1;
pair <int64_t, int64_t> best = make_pair(-1, -1);
for (int64_t i = optl; i < min(mid, optr + 1); ++i) best = max(best, make_pair(dp[row ^ 1][i] + (a[n] - a[mid]) * (a[mid] - a[i]), i));
dp[row][mid] = best.first;
par[k][mid] = best.second;
int64_t opt = best.second;
compute(l, mid - 1, optl, opt, k);
compute(mid + 1, r, opt, optr, k);
}
inline void solve() {
int32_t k;
cin >> n >> k;
memset(a, 0, sizeof a);
for (int32_t i = 1; i <= n; ++i) {
cin >> a[i];
a[i] += a[i - 1];
}
for (int32_t i = 0; i <= k; ++i) {
for (int32_t j = 0; j <= n; ++j) {
par[i][j] = -1;
}
}
for (int32_t i = 0; i <= n; ++i) {
dp[0][i] = dp[1][i] = -1;
}
dp[0][0] = 0;
for (int32_t i = 1; i <= k; ++i) {
compute(0, n - 1, 0, n - 1, i);
}
pair <int64_t, int32_t> ans = mp(-1, -1);
for (int32_t i = 1; i <= n; ++i) {
ans = max(ans, mp(dp[k & 1][i], i));
}
print(ans.F);
vector <int32_t> seq(k + 1);
int32_t cur = k;
while (k && ans.S != -1) {
seq[cur--] = ans.S;
assert(ans.S >= 1 && ans.S <= n);
ans.S = par[k--][ans.S];
}
Print(seq, 1);
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int T = 1;
// cin >> T;
for (int test = 1; test <= T; ++test) {
// cout << "Case #" << test << ": ";
solve();
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1100 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
1100 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
1100 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
1100 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
1100 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
1100 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
1100 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
1100 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
1100 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
1100 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
1100 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 ms |
1100 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
1100 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
1100 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
1100 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
1100 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
1100 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1100 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
1100 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
1356 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
1100 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
1100 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
1100 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
1228 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
1100 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
1100 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
1100 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1100 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
1100 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
2 ms |
2124 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
1100 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
2 ms |
1868 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
2 ms |
1996 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
2 ms |
2124 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
1356 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
1228 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
1 ms |
1356 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1100 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
1100 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
6 ms |
2764 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
1100 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
10 ms |
2764 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
8 ms |
2508 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
7 ms |
2764 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
5 ms |
2764 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
3 ms |
1356 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
4 ms |
1740 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
1356 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
2 ms |
1356 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
52 ms |
10060 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
3 ms |
1356 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
77 ms |
6476 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
83 ms |
7436 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
61 ms |
7884 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
40 ms |
6604 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
62 ms |
7372 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
79 ms |
9144 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
25 ms |
4172 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
24 ms |
4172 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
623 ms |
81840 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
21 ms |
4684 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1443 ms |
81632 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
853 ms |
58040 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
636 ms |
62236 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
444 ms |
51172 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
640 ms |
58124 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
832 ms |
73852 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
