//khodaya khodet komak kon
#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define all(x) x.begin(), x.end()
#pragma GCC optimise ("ofast")
#pragma GCC optimise("unroll-loops")
//#define int long long
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const int N = 100000 + 10;
const ll MOD = 1000000000 + 7;
const ll INF = 1000000000000000000;
const ll LOG = 25;
int n, k, a[N], opt[N][210];
ll dp[N][2], ps[N];
ll cost (int l, int r){
ll x = ps[r] - ps[l - 1];
return x * x;
}
int solve(int l, int r, int lq, int rq, int x, int f){
if (rq < lq) return 0;
int md = (lq + rq) >> 1;
for (int i = l; i < min(r + 1, md); i++){
if (dp[md][f] > dp[i][f ^ 1] + cost(i + 1, md)){
dp[md][f] = dp[i][f ^ 1] + cost(i + 1, md);
opt[md][x] = i;
}
}
//cout << opt[md][x] << '\n';
if (lq == rq) return 0;
solve(l, opt[md][x], lq, md - 1, x,f);
solve(opt[md][x], r, md + 1, rq, x,f);
}
int32_t main(){
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n >> k;
for (int i = 1; i <= n; i++){
cin >> a[i];
ps[i] = ps[i - 1] + a[i];
}
if (k == 0) return cout << 0, 0;
bool f = 0;
for (int i = 1; i <= n; i++){
dp[i][1] = ps[i] * ps[i];
}
for (int i = 2; i <= k + 1; i++){
for (int j = 0; j < N; j++) dp[j][f] = INF;
solve(1, n, i, n, i, f);
f ^= 1;
}
cout << (ps[n] * 1ll * ps[n] - dp[n][f ^ 1]) / 2<< '\n';
vector<int> ans;
int Now = n;
for (int i = k + 1; i >= 2; i--){
ans.pb(opt[Now][i]);
Now = opt[Now][i];
}
reverse(all(ans));
for (auto u:ans) cout << u << ' ';
return 0;
}
/*
7 3
4 1 3 4 0 2 3
*/
Compilation message
sequence.cpp:8:0: warning: ignoring #pragma GCC optimise [-Wunknown-pragmas]
#pragma GCC optimise ("ofast")
sequence.cpp:9:0: warning: ignoring #pragma GCC optimise [-Wunknown-pragmas]
#pragma GCC optimise("unroll-loops")
sequence.cpp: In function 'int solve(int, int, int, int, int, int)':
sequence.cpp:44:1: warning: control reaches end of non-void function [-Wreturn-type]
}
^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
1920 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
6 ms |
1920 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
5 ms |
1920 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
6 ms |
1920 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
5 ms |
1920 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
5 ms |
1920 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
5 ms |
1920 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
5 ms |
1920 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
5 ms |
1920 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
5 ms |
1920 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
5 ms |
1920 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
5 ms |
1920 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
5 ms |
1920 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
6 ms |
1920 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
6 ms |
1920 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
5 ms |
1920 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
5 ms |
1920 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
1920 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
5 ms |
1920 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
8 ms |
1920 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
6 ms |
1920 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
6 ms |
1920 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
6 ms |
1952 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
7 ms |
1920 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
6 ms |
1920 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
6 ms |
1920 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
6 ms |
1920 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
7 ms |
2048 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
6 ms |
2048 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
14 ms |
2048 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
6 ms |
2048 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
12 ms |
2048 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
14 ms |
2048 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
14 ms |
2048 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
7 ms |
2048 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
7 ms |
2048 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
8 ms |
2048 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
2688 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
6 ms |
2688 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
19 ms |
2688 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
6 ms |
2688 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
26 ms |
2816 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
20 ms |
2688 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
21 ms |
2688 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
19 ms |
2688 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
9 ms |
2688 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
12 ms |
2688 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
13 ms |
10240 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
11 ms |
10240 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
112 ms |
10296 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
11 ms |
10240 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
93 ms |
10240 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
96 ms |
10240 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
83 ms |
10240 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
65 ms |
10240 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
79 ms |
10240 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
100 ms |
10240 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
71 ms |
85240 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
70 ms |
85368 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
1342 ms |
85432 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
66 ms |
85240 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1834 ms |
85320 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
1149 ms |
85368 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
1112 ms |
85240 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
825 ms |
85372 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
1033 ms |
85240 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
1305 ms |
85372 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
