#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int n, m, a[N], pref[N];
int pr[202][N];
struct line{
long long k, b;
int pos;
inline long long val(int x){
return k * x + b;
}
};
line q1[N], q2[N];
int sz1, sz2;
inline long long intersect(line l1, line l2){
return (l1.b - l2.b) / (l2.k - l1.k);
}
inline bool Is_need_to_erase(line l1, line l2, line l3){
long long x = intersect(l1, l3);
return l2.val(x) <= l3.val(x);
}
inline void Add(line new_line){
if(sz1 && q1[sz1 - 1].k == new_line.k){
if(q1[sz1 - 1].b < new_line.b){
sz1 -= 1;
}
else{
return;
}
}
while(sz1 > 2 && Is_need_to_erase(q1[sz1 - 2], q1[sz1 - 1], new_line)){
sz1 -= 1;
}
q1[sz1] = new_line;
sz1 += 1;
}
inline void Swap(){
swap(q1, q2);
swap(sz1, sz2);
sz1 = 0;
}
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin >> n >> m;
for(int i = 1; i <= n; i++){
cin >> a[i];
pref[i] = pref[i - 1] + a[i];
}
for(int i = 1; i <= n; i++){
Add({pref[i], -(1LL * pref[i] * pref[i]), i});
}
Swap();
long long ans = 0;
for(int i = 1; i <= m; i++){
int pos = 0;
for(int j = i + 1; j <= n; j++){
while(pos + 1 < sz2 && q2[pos + 1].pos < j && q2[pos].val(pref[j]) <= q2[pos + 1].val(pref[j])){
pos += 1;
}
pr[i][j] = q2[pos].pos;
ans = q2[pos].val(pref[j]);
Add({pref[j], ans - 1LL * pref[j] * pref[j], j});
}
Swap();
}
cout << ans << "\n";
vector < int > anss;
for(int i = m, x = n; x && i >= 1; i--){
x = pr[i][x];
anss.push_back(x);
}
reverse(anss.begin(), anss.end());
for(auto it : anss){
cout << it << " ";
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
8 ms |
4992 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
7 ms |
5120 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
8 ms |
5120 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
9 ms |
5120 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
11 ms |
5068 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
8 ms |
4992 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
7 ms |
4992 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
7 ms |
4992 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
8 ms |
4992 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
9 ms |
5248 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
9 ms |
5120 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
9 ms |
5120 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
9 ms |
5120 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
8 ms |
5120 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
9 ms |
5120 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
8 ms |
4992 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
8 ms |
4992 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
9 ms |
5120 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
8 ms |
5120 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
25 ms |
5240 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
8 ms |
5120 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
10 ms |
5120 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
9 ms |
5120 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
16 ms |
5248 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
11 ms |
5108 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
10 ms |
5120 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
13 ms |
5120 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
8 ms |
4992 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
9 ms |
5120 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
91 ms |
6108 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
9 ms |
5120 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
68 ms |
5752 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
72 ms |
6008 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
78 ms |
6092 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
29 ms |
5372 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
17 ms |
5248 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
27 ms |
5376 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
8 ms |
5120 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
9 ms |
5120 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
79 ms |
6776 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
8 ms |
5120 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
78 ms |
6748 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
84 ms |
6520 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
80 ms |
6684 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
87 ms |
6716 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
22 ms |
5376 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
46 ms |
5752 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
10 ms |
5248 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
10 ms |
5248 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
143 ms |
13892 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
10 ms |
5376 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
92 ms |
10360 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
99 ms |
11256 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
113 ms |
11768 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
87 ms |
10468 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
98 ms |
11236 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
121 ms |
13048 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
35 ms |
7032 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
26 ms |
7160 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
679 ms |
84692 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
28 ms |
7544 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
760 ms |
84344 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
566 ms |
60920 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
616 ms |
65004 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
460 ms |
54000 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
467 ms |
60944 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
644 ms |
76692 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
