#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 203;
const int maxn=1e5+3;
int n,k;
ll p[maxn];
pair<ll,int> dp[N][maxn];
struct line {
ll m, c;
int idx;
long long eval(long long x) { return m * x + c; }
long double intersectX(line l) {
if(l.m == m){
cout<<"HAHAHAHA\n";
exit(0);
}
return (long double) (c - l.c) / (l.m - m);
}
};
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> k;
for(int i = 1;i <= n;i++){
int x; cin >> x;
p[i] = x + p[i - 1];
}
for(int i = 1;i <= k;i++){
deque<line>dq;
dq.push_front({p[i],dp[i-1][i].first - p[i] * p[i],i});
for(int j = i + 1;j <= n;j++){
while(dq.size() >= 2 and dq[0].eval(p[j]) <= dq[1].eval(p[j])) dq.pop_front();
dp[i][j].first = dq[0].eval(p[j]);
dp[i][j].second = dq[0].idx;
line cur = {p[j],dp[i - 1][j].first - p[j] * p[j],j};
while(dq.size() >= 2 and cur.intersectX(dq[(int)dq.size()-2]) <= dq.back().intersectX(dq[(int)dq.size()-2])) dq.pop_back();
dq.push_back(cur);
}
}
cout<<dp[k][n].first<<'\n';
int idx = dp[k][n].second;
for(int i = k-1;i >= 0;i--){
cout<<idx<<' ';
assert(idx >= 0 and idx <= n);
idx = dp[i][idx].second;
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 108 == 108 |
2 |
Correct |
0 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 |
1 ms |
332 KB |
contestant found the optimal answer: 1542524 == 1542524 |
5 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
6 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 1 == 1 |
7 |
Correct |
0 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 |
0 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 |
384 KB |
contestant found the optimal answer: 805 == 805 |
16 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 900189994 == 900189994 |
17 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 999919994 == 999919994 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 1093956 == 1093956 |
2 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 302460000 == 302460000 |
3 |
Correct |
0 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 |
0 ms |
332 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
6 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 933702 == 933702 |
7 |
Correct |
0 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 |
1 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 |
1 ms |
332 KB |
contestant found the optimal answer: 610590000 == 610590000 |
2 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 311760000 == 311760000 |
3 |
Correct |
2 ms |
1996 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 |
Correct |
1 ms |
1484 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
6 |
Correct |
2 ms |
1868 KB |
contestant found the optimal answer: 107630884 == 107630884 |
7 |
Correct |
2 ms |
1996 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
8 |
Correct |
1 ms |
716 KB |
contestant found the optimal answer: 193556962 == 193556962 |
9 |
Correct |
1 ms |
588 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
10 |
Correct |
1 ms |
844 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 |
9 ms |
4556 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 |
Correct |
7 ms |
4556 KB |
contestant found the optimal answer: 679388326 == 679388326 |
6 |
Correct |
7 ms |
3916 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
7 |
Correct |
7 ms |
4556 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
8 |
Correct |
6 ms |
4556 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
9 |
Correct |
2 ms |
1228 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
10 |
Correct |
3 ms |
1996 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
972 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
2 |
Correct |
3 ms |
1044 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
3 |
Correct |
71 ms |
32908 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
4 |
Correct |
2 ms |
972 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
5 |
Correct |
51 ms |
19968 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
6 |
Correct |
57 ms |
23172 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
7 |
Correct |
60 ms |
24772 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
8 |
Correct |
46 ms |
20288 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
9 |
Correct |
55 ms |
23188 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
10 |
Correct |
71 ms |
29580 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
19 ms |
6300 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
2 |
Correct |
19 ms |
6240 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
3 |
Runtime error |
290 ms |
131076 KB |
Execution killed with signal 9 |
4 |
Halted |
0 ms |
0 KB |
- |