#include<bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
const int N = 100002;
int n, k;
ll a[N], sum[N], dp[2][N];
ll cost (int l, int r) {
return (sum[r+1] - sum[l]) * (sum[n] - sum[r+1]);
}
int nxt[210][N];
int prv, at;
void solve (int lo, int hi, int opt_beg, int opt_end, int k) {
if (lo > hi) return ;
int mid = (lo + hi) / 2;
int opt = -1;
dp[at][mid] = -1;
for (int i = max(mid, opt_beg); i <= opt_end; i++) {
ll tmp = dp[prv][i+1] + cost(mid, i);
if (dp[at][mid] < tmp) {
dp[at][mid] = tmp;
opt = i;
}
}
nxt[k][mid] = opt;
solve(lo, mid-1, opt_beg, opt, k);
solve(mid+1, hi, opt, opt_end, k);
}
int main (void) {
scanf("%d %d", &n, &k);
for (int i = 0; i < n; i++) {
scanf("%lld", a + i);
sum[i+1] = sum[i] + a[i];
}
memset (dp, -1, sizeof dp);
for (int i = 0; i < n; i++) dp[0][i] = 0;
at = 1;
for (int i = 1; i <= k; i++) {
solve(0, n-1, 0, n-1, i);
swap (prv, at);
}
cout << dp[prv][0] << endl;
vector <int> path;
int x = k, y = 0;
while (x) {
path.pb(nxt[x][y]);
y = nxt[x][y] + 1;
x--;
}
for (auto u : path) cout << u + 1 << " ";
cout << endl;
return 0;
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:39: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:41:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld", a + i);
~~~~~^~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
1912 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
3 ms |
1912 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
3 ms |
1984 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
4 ms |
2132 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
3 ms |
2132 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
4 ms |
2132 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
4 ms |
2276 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
4 ms |
2276 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
3 ms |
2276 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
3 ms |
2276 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
3 ms |
2276 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
3 ms |
2280 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
4 ms |
2284 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
3 ms |
2288 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
3 ms |
2292 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
4 ms |
2424 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
3 ms |
2424 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
2424 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
4 ms |
2424 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
4 ms |
2576 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
3 ms |
2576 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
3 ms |
2576 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
4 ms |
2576 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
3 ms |
2576 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
4 ms |
2576 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
4 ms |
2576 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
3 ms |
2576 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
2576 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
3 ms |
2576 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
5 ms |
3380 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
3 ms |
3380 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
5 ms |
3380 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
5 ms |
3384 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
5 ms |
3388 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
4 ms |
3388 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
4 ms |
3388 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
4 ms |
3388 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
3388 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
4 ms |
3388 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
14 ms |
4044 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
5 ms |
4044 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
14 ms |
4168 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
13 ms |
4168 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
12 ms |
4188 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
15 ms |
4188 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
6 ms |
4188 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
20 ms |
4188 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
7 ms |
4188 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
7 ms |
4188 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
95 ms |
11312 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
6 ms |
11312 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
85 ms |
11312 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
79 ms |
11312 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
82 ms |
11312 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
63 ms |
11312 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
84 ms |
11312 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
99 ms |
11312 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
48 ms |
11312 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
44 ms |
11312 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
889 ms |
82560 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
32 ms |
82560 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1621 ms |
83532 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
972 ms |
83532 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
917 ms |
83532 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
650 ms |
83532 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
853 ms |
83532 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
1068 ms |
83532 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
