#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define S second
#define F first
#define pb push_back
#define mp make_pair
#define pii pair <int, int>
#define fast_io ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
const int maxn = 1e5 + 2, maxk = 200 + 3;
ll dp[3][maxn], ps[maxn], a[maxn], inf = 1e18;
int opt[maxk][maxn];
inline ll ch(ll x){
return x * (x - 1) / (ll)2;
}
void solve(int l, int r, int x, int y, int k){
if(l + 1 > r){
return;
}
int mid = (l + r) / 2;
dp[k & 1][mid] = inf;
for(int i = x; i < min(y, mid); i ++){
ll val = dp[(k - 1) & 1][i] + ch(ps[mid + 1] - ps[i + 1]);
if(val < dp[k & 1][mid]){
dp[k & 1][mid] = val;
opt[k][mid] = i;
}
}
//cout << mid << " " << k << " : " << dp[k][mid] << endl;
solve(l, mid, x, opt[k][mid] + 1, k);
solve(mid + 1, r, opt[k][mid], y, k);
}
int main(){
fast_io;
int n, k;
cin >> n >> k;
ll sum = 0;
for(int i = 0; i < n; i ++){
cin >> a[i];
ps[i + 1] = ps[i] + a[i];
sum += a[i];
}
for(int i = 0; i < n; i ++){
dp[1][i] = ch(ps[i + 1]);
opt[1][i] = -1;
}
for(int i = 2; i <= k + 1; i ++){
solve(0, n, 0, n, i);
}
//cout << "dp : " << dp[k + 1][n - 1] << endl;
cout << ch(sum) - dp[(k + 1) & 1][n - 1] << endl;
int x = opt[k + 1][n - 1];
int t = k + 1;
while(x != -1){
cout << x + 1 << " ";
t --;
x = opt[t][x];
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
588 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
2 ms |
1356 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
2 ms |
972 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
2 ms |
1228 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
2 ms |
1356 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
588 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
1 ms |
588 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
8 ms |
1996 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
12 ms |
2020 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
10 ms |
1692 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
10 ms |
1936 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
8 ms |
1996 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
3 ms |
716 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
5 ms |
972 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
716 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
3 ms |
844 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
89 ms |
9356 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
4 ms |
716 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
103 ms |
5804 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
99 ms |
6744 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
80 ms |
7196 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
58 ms |
5992 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
84 ms |
6768 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
107 ms |
8404 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
32 ms |
4968 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
31 ms |
4948 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
930 ms |
82544 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
26 ms |
5448 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1696 ms |
82228 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
1086 ms |
58760 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
881 ms |
63020 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
665 ms |
51908 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
901 ms |
59044 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
1139 ms |
74520 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
