#include <bits/stdc++.h>
#define ll long long
#define mp make_pair
#define pb push_back
#define ld long double
#define ss(x) (int) x.size()
#define FOR(i, n) for(int i = 1; i <= n; ++i)
#define fi first
#define se second
#define cat(x) cout << #x << " = " << x << endl
using namespace std;
const int nax = 1e5 + 111;
const long long inf = 1e18;
int n, k;
int a[nax];
ll dp[nax][2];
int opt[nax][202];
int pref[nax];
int ja, on, K;
void solve(int l, int r, int optl, int optr) {
if(l > r) return;
int m = (l + r) / 2;
for(int i = optl; i <= min(m, optr); ++i) {
ll w = dp[i - 1][on] + 1ll * (pref[m] - pref[i - 1]) * (pref[m] - pref[i - 1]);
if(w < dp[m][ja]) {
opt[m][K] = i;
dp[m][ja] = w;
}
}
solve(l, m - 1, optl, opt[m][K]);
solve(m + 1, r, opt[m][K], optr);
}
int main() {
scanf("%d %d", &n, &k);
k += 1;
for(int i = 1; i <= n; ++i) {
scanf("%d", a + i);
pref[i] = pref[i - 1] + a[i];
}
for(int i = 1; i <= n; ++i)
dp[i][0] = inf;
for(int i = 1; i <= k; ++i) {
K = i;
ja = i & 1;
on = !ja;
for(int j = 0; j <= n; ++j)
dp[j][ja] = inf;
solve(1, n, 1, n);
}
ll kwa = 1ll * pref[n] * pref[n];
printf("%lld\n", (kwa - dp[n][k & 1]) / 2);
vector <int> v;
int ind = n;
while(k > 1) {
assert(ind > 0);
assert(opt[ind][k] > 1);
v.pb(opt[ind][k]);
ind = opt[ind][k] - 1;
k -= 1;
}
reverse(v.begin(), v.end());
for(auto it : v)
printf("%d ", it - 1);
return 0;
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:40:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d", &n, &k);
~~~~~^~~~~~~~~~~~~~~~~
sequence.cpp:43:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", a + i);
~~~~~^~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Runtime error |
7 ms |
504 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
380 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
3 ms |
504 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
3 ms |
504 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Runtime error |
8 ms |
888 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 7 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
1144 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
3 ms |
1144 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
9 ms |
1144 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
3 ms |
1144 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
12 ms |
1148 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
11 ms |
1144 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
10 ms |
1144 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
8 ms |
1144 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
4 ms |
1148 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
6 ms |
1144 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
11 ms |
8440 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
10 ms |
8440 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
138 ms |
8568 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
10 ms |
8440 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
91 ms |
8440 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
91 ms |
8556 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
83 ms |
8560 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
61 ms |
8440 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
81 ms |
8440 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
103 ms |
8440 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
110 ms |
81724 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
103 ms |
81756 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
1004 ms |
81872 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
97 ms |
81784 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1792 ms |
81800 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
1114 ms |
81784 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
1034 ms |
81812 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
784 ms |
81784 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
1008 ms |
81912 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
1274 ms |
81888 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
