#include<bits/stdc++.h>
#define taskname "sequence"
using namespace std;
typedef long long ll;
template<class T>bool minimize(T& a, T b){
if(a > b){
a = b;
return true;
}
return false;
}
const ll INF = 1e18;
const int lim = 1e5 + 5;
const int lim_k = 201;
int n, k, a[lim], f[lim], opt[lim_k][lim];
ll f_square[lim], dp[2][lim];
bool cur = true, pre = false;
ll square(int x){
return 1LL * x * x;
}
ll cost(int l, int r){
return (square(f[r] - f[l - 1]) - f_square[r] + f_square[l - 1]) >> 1LL;
}
void solve(const int id, int l, int r, int opt_l, int opt_r){
if(l > r){
return;
}
int m = (l + r) >> 1;
dp[cur][m] = INF;
for(int i = min(m, opt_r); i >= opt_l; i--){
if(minimize(dp[cur][m], dp[pre][i - 1] + cost(i, m))){
opt[id][m] = i;
}
}
solve(id, l, m - 1, opt_l, opt[id][m]);
solve(id, m + 1, r, opt[id][m], opt_r);
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
if(fopen(taskname".inp", "r")){
freopen(taskname".inp", "r", stdin);
}
cin >> n >> k;
f[0] = dp[cur][0] = f_square[0] = 0;
for(int i = 1; i <= n; i++){
cin >> a[i];
dp[cur][i] = (square(f[i] = f[i - 1] + a[i]) - (f_square[i] = f_square[i - 1] + square(a[i]))) >> 1LL;
}
for(int i = 0; i < k; i++){
swap(cur, pre);
for(int j = i + 1; j > 0; j--){
dp[cur][j] = 0;
}
solve(i, i + 2, n, i + 2, n);
}
cout << cost(1, n) - dp[cur][n] << "\n";
vector<int>cut_point;
for(int i = k - 1, vertex = n; i > -1; i--){
cut_point.emplace_back(vertex = opt[i][vertex] - 1);
}
for(int i = k - 1; i > -1; i--){
cout << cut_point[i] << " ";
}
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:41:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
41 | freopen(taskname".inp", "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
2 ms |
4444 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
8 ms |
22876 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
6744 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
6488 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
2 ms |
12636 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
8540 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
9 ms |
39972 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
7 ms |
41564 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
6 ms |
37724 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
5 ms |
37724 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
4 ms |
20828 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
2 ms |
14680 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
4 ms |
24924 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
9 ms |
36188 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
4640 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
11 ms |
34140 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
11 ms |
32092 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
10 ms |
34360 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
8 ms |
36188 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
4 ms |
18780 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
6 ms |
33116 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
4700 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
2 ms |
4700 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
54 ms |
40528 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
2 ms |
4700 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
61 ms |
37020 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
56 ms |
39600 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
56 ms |
40120 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
40 ms |
38992 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
54 ms |
41364 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
70 ms |
38156 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
23 ms |
5520 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
23 ms |
5460 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
595 ms |
82184 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
16 ms |
5720 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1095 ms |
81976 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
671 ms |
58296 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
580 ms |
62396 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
443 ms |
51448 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
543 ms |
58576 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
708 ms |
74160 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
