#include <bits/stdc++.h>
#define FOR(x, a, b) for (int x = a; x <= b; ++x)
#define FOD(x, a, b) for (int x = a; x >= b; --x)
#define REP(x, a, b) for (int x = a; x < b; ++x)
#define DEBUG(X) { cout << #X << " = " << X << endl; }
#define PR(A, n) { cout << #A << " = "; FOR(_, 1, n) cout << A[_] << " "; cout << endl; }
#define PR0(A, n) { cout << #A << " = "; REP(_, 0, n) cout << A[_] << " "; cout << endl; }
#define BitCount(x) __builtin_popcount(x)
using namespace std;
typedef long long LL;
const int N = 1e5 + 10;
const int M = 2e2 + 10;
const int INF = 2e9 + 10;
int n, m, ansSize = 0;
int a[N], ans[N];
int S[N];
int tr[M][N];
LL dp[2][N];
void Compute(int p, int l, int r, int u, int v) {
if (l > r) return;
int m = (l + r) >> 1;
int nxt = p & 1, pre = nxt ^ 1;
if (p < m) {
int x = max(u, p), y = min(m - 1, v), best = -1;
FOR(i, x, y)
if (dp[nxt][m] < dp[pre][i] + (LL)S[i] * (S[m] - S[i])) {
dp[nxt][m] = dp[pre][i] + (LL)S[i] * (S[m] - S[i]);
tr[p][m] = i;
best = i;
}
Compute(p, l, m - 1, u, best);
Compute(p, m + 1, r, best, v);
} else {
Compute(p, l, m - 1, u, v);
Compute(p, m + 1, r, u, v);
}
}
int main() {
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif // LOCAL
scanf("%d%d", &n, &m);
FOR(i, 1, n) scanf("%d", &a[i]);
FOR(i, 1, n) S[i] = S[i - 1] + a[i];
FOR(i, 1, n) dp[0][i] = 0;
FOR(i, 1, m) {
FOR(j, 0, n) dp[i & 1][j] = -INF;
Compute(i, 1, n, 1, n);
}
printf("%lld\n", dp[m & 1][n]);
while (tr[m][n] != 0) {
ans[++ansSize] = tr[m][n];
n = tr[m][n]; --m;
}
FOD(i, ansSize, 1) printf("%d ", ans[i]);
return 0;
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:52:26: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d", &n, &m);
^
sequence.cpp:53:36: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
FOR(i, 1, n) scanf("%d", &a[i]);
^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
86788 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
86788 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
86788 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
0 ms |
86788 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
86788 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
86788 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
0 ms |
86788 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
86788 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
86788 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
0 ms |
86788 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
0 ms |
86788 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
86788 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
0 ms |
86788 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
0 ms |
86788 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
0 ms |
86788 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
0 ms |
86788 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
0 ms |
86788 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
86788 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
86788 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
0 ms |
86788 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
0 ms |
86788 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
0 ms |
86788 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
0 ms |
86788 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
0 ms |
86788 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
0 ms |
86788 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
0 ms |
86788 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
0 ms |
86788 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
86788 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
0 ms |
86788 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
0 ms |
86788 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
0 ms |
86788 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
0 ms |
86788 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
0 ms |
86788 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
0 ms |
86788 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
0 ms |
86788 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
0 ms |
86788 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
0 ms |
86788 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
86788 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
0 ms |
86788 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
6 ms |
86788 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
0 ms |
86788 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
9 ms |
86788 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
6 ms |
86788 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
6 ms |
86788 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
3 ms |
86788 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
0 ms |
86788 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
3 ms |
86788 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
86788 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
0 ms |
86788 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
73 ms |
86788 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
0 ms |
86788 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
86 ms |
86788 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
79 ms |
86788 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
73 ms |
86788 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
49 ms |
86788 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
73 ms |
86788 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
89 ms |
86788 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
33 ms |
86788 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
29 ms |
86788 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
793 ms |
86788 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
26 ms |
86788 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1659 ms |
86788 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
1008 ms |
86788 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
883 ms |
86788 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
596 ms |
86788 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
863 ms |
86788 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
1099 ms |
86788 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
