#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
ll pre[100005];
ll dp[100005];
ll dpp[100005];
int prosli[205][100005];
struct line{
ll a, b;
int ind;
ll eval(ll x){
return a*x+b;
}
ll intersect(line g){
return -floor(1.0*(b-g.b)/(a-g.a));
}
};
int main(){
ios_base::sync_with_stdio(false), cin.tie(0);
int n, k;
cin >> n >> k;
for(int i=1; i<=n; i++){
int x;
cin >> x;
pre[i] = pre[i-1] + x;
}
for(int j=1; j<=k; j++){
deque <line> lines;
line nline;
nline.a = pre[j];
nline.b = -pre[j]*pre[j] + dpp[j];
nline.ind = j;
lines.push_back(nline);
for(int i=j+1; i<=n; i++){
while(lines.size() >= 2 && lines.front().eval(pre[i]) <= lines[1].eval(pre[i])){
lines.pop_front();
}
dp[i] = lines.front().eval(pre[i]);
prosli[j][i] = lines.front().ind;
nline.a = pre[i];
nline.b = -pre[i]*pre[i] + dpp[i];
nline.ind = i;
if(nline.a == lines.back().a){
if(nline.b <= lines.back().b) continue;
lines.pop_back();
lines.push_back(nline);
}
else{
while(lines.size() >= 2 && nline.intersect(lines.back()) <= lines.back().intersect(lines[lines.size()-2])){
lines.pop_back();
}
lines.push_back(nline);
}
}
for(int i=1; i<=n; i++){
dpp[i] = dp[i];
}
}
cout << dp[n] << "\n";
int t = n;
for(int i=k; i>=1; i--){
cout << prosli[i][t] << " ";
t = prosli[i][t];
}
return 0;
}
/*
7 3
4 1 3 4 0 2 3
*/
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 108 == 108 |
2 |
Correct |
0 ms |
364 KB |
contestant found the optimal answer: 999 == 999 |
3 |
Correct |
0 ms |
364 KB |
contestant found the optimal answer: 0 == 0 |
4 |
Correct |
0 ms |
364 KB |
contestant found the optimal answer: 1542524 == 1542524 |
5 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
6 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1 == 1 |
7 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1 == 1 |
8 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1 == 1 |
9 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 100400096 == 100400096 |
10 |
Correct |
0 ms |
364 KB |
contestant found the optimal answer: 900320000 == 900320000 |
11 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
12 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
13 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 140072 == 140072 |
14 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 376041456 == 376041456 |
15 |
Correct |
0 ms |
364 KB |
contestant found the optimal answer: 805 == 805 |
16 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 900189994 == 900189994 |
17 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 999919994 == 999919994 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
364 KB |
contestant found the optimal answer: 1093956 == 1093956 |
2 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 302460000 == 302460000 |
3 |
Correct |
1 ms |
620 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
4 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
5 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
6 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 933702 == 933702 |
7 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
8 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 687136 == 687136 |
9 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
10 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 610590000 == 610590000 |
2 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 311760000 == 311760000 |
3 |
Correct |
2 ms |
1408 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 |
Correct |
1 ms |
1132 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
6 |
Correct |
2 ms |
1260 KB |
contestant found the optimal answer: 107630884 == 107630884 |
7 |
Correct |
2 ms |
1388 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
8 |
Correct |
1 ms |
620 KB |
contestant found the optimal answer: 193556962 == 193556962 |
9 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
10 |
Correct |
1 ms |
620 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 21503404 == 21503404 |
2 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 140412195 == 140412195 |
3 |
Correct |
10 ms |
2028 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 |
Correct |
8 ms |
2028 KB |
contestant found the optimal answer: 679388326 == 679388326 |
6 |
Correct |
8 ms |
1772 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
7 |
Correct |
11 ms |
2028 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
8 |
Correct |
8 ms |
2028 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
9 |
Correct |
3 ms |
748 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
10 |
Correct |
4 ms |
1132 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
876 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
2 |
Correct |
3 ms |
876 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
3 |
Correct |
102 ms |
9580 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
4 |
Correct |
3 ms |
876 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
5 |
Correct |
60 ms |
5944 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
6 |
Correct |
67 ms |
6764 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
7 |
Correct |
83 ms |
7276 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
8 |
Correct |
64 ms |
6124 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
9 |
Correct |
67 ms |
6892 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
10 |
Correct |
85 ms |
8556 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
22 ms |
4420 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
2 |
Correct |
22 ms |
4424 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
3 |
Correct |
977 ms |
81188 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
4 |
Correct |
25 ms |
4596 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
5 |
Correct |
965 ms |
81156 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
6 |
Correct |
696 ms |
57672 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
7 |
Correct |
828 ms |
61804 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
8 |
Correct |
664 ms |
50652 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
9 |
Correct |
658 ms |
57708 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
10 |
Correct |
850 ms |
73328 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |