#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ff first
#define ss second
int A[100001], S[100001];
ll dp[2][100001];
pair<int, ll> line[2][100001];
int cnt[2], idx[2][100001];
int pre[201][100001];
inline ll f(int t, int i, int x){
return 1ll * line[t][i].ff * x + line[t][i].ss;
}
inline double crs(pair<int, ll> x, pair<int, ll> y){
return (double)(y.ss - x.ss) / (x.ff - y.ff);
}
int main(){
ios_base::sync_with_stdio(0), cin.tie(0);
int N, K; cin>>N>>K;
for(int i=0; i<N; ++i) cin>>A[i];
S[0] = A[0];
for(int i=1; i<N; ++i) S[i] = S[i-1] + A[i];
idx[1][1] = N;
for(int k=0; k<=K; ++k){
int t = k&1;
cnt[t] = 0;
idx[!t][cnt[!t]] = N;
for(int i=k, j=0; i<N; ++i){
while(idx[!t][j+1] < i && f(!t, j, S[i]) <= f(!t, j+1, S[i])) ++j;
dp[t][i] = f(!t, j, S[i]);
pre[k][i] = idx[!t][j];
pair<int, ll> newLine = {S[i], dp[t][i]-1ll*S[i]*S[i]};
while(cnt[t] > 1 && crs(line[t][cnt[t]-1], line[t][cnt[t]-2]) >= crs(line[t][cnt[t]-2], newLine)) --cnt[t];
idx[t][cnt[t]] = i;
line[t][cnt[t]++] = newLine;
}
}
vector<int> ans;
for(int i=N-1, cnt=K; cnt; --cnt) ans.push_back(i = pre[cnt][i]);
reverse(ans.begin(), ans.end());
cout<<dp[K&1][N-1]<<'\n';
for(auto i: ans) cout<<i+1<<' ';
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
3 ms |
640 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
3 ms |
512 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
3 ms |
384 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
5 ms |
1536 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
2 ms |
384 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
4 ms |
1152 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
4 ms |
1408 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
4 ms |
1408 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
2 ms |
640 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
3 ms |
512 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
3 ms |
768 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
3 ms |
512 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
6 ms |
2096 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
3 ms |
512 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
8 ms |
2176 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
7 ms |
1920 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
7 ms |
2176 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
6 ms |
2048 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
3 ms |
768 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
4 ms |
1152 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
1152 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
4 ms |
1152 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
39 ms |
9724 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
5 ms |
1152 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
33 ms |
6264 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
37 ms |
7032 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
38 ms |
7604 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
32 ms |
6392 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
35 ms |
7160 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
37 ms |
8824 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
24 ms |
7360 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
23 ms |
7552 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
338 ms |
85880 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
24 ms |
8704 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
594 ms |
84856 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
367 ms |
61008 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
448 ms |
66168 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
282 ms |
55108 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
303 ms |
61816 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
354 ms |
77404 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
