#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
ll n, m, a[100100], pref[100100];
int pr[100100][210];
struct line{
ll k, b;
int pos;
inline ll eval(ll x){
return k*x+b;
}
};
inline ll intersect(line l1, line l2){
return (l1.b-l2.b)/(l2.k-l1.k);
}
inline bool to_erase(line l1, line l2, line l3){
ll x = intersect(l1, l3);
return l2.eval(x) <= l3.eval(x);
}
int sz1, sz2;
line vec[100100], vecCur[100100];
inline void insrt(line ln){
if (sz1 && vec[sz1-1].k == ln.k){
if (vec[sz1-1].b < ln.b)
sz1--; else
return;
}
while(sz1 > 2 && to_erase(vec[sz1-2], vec[sz1-1], ln))
sz1--;
vec[sz1] = ln;
++sz1;
}
void swp(){
swap(vec, vecCur);
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++)
insrt({pref[i], -(pref[i]*pref[i]), i});
swp();
ll ans = 0;
for (int ii = 1; ii <= m; ii++){
int pos = 0;
for (int i = ii+1; i <= n; i++){
while(pos+1 < sz2 && vecCur[pos+1].pos < i && vecCur[pos].eval(pref[i]) <= vecCur[pos+1].eval(pref[i]))
++pos;
pr[i][ii] = vecCur[pos].pos;
ans = vecCur[pos].eval(pref[i]);
insrt({pref[i], ans-(pref[i]*pref[i]), i});
}
swp();
}
cout << ans << endl;
vector <int> vecAns;
int x = n, y = m;
while(x != 0){
x = pr[x][y];
y--;
vecAns.push_back(x);
}
vecAns.pop_back();
for (int i = vecAns.size()-1; i >= 0; i--)
cout << vecAns[i] << ' ';
}
/**
7 3
4 1 3 4 0 2 3
*/
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
11 ms |
5112 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
9 ms |
5120 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
8 ms |
5328 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
10 ms |
5328 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
11 ms |
5328 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
9 ms |
5328 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
8 ms |
5348 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
8 ms |
5384 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
9 ms |
5384 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
9 ms |
5384 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
9 ms |
5384 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
9 ms |
5384 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
9 ms |
5384 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
9 ms |
5384 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
9 ms |
5384 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
9 ms |
5384 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
9 ms |
5384 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
11 ms |
5440 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
9 ms |
5576 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
24 ms |
5576 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
9 ms |
5576 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
11 ms |
5576 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
10 ms |
5576 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
17 ms |
5576 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
13 ms |
5576 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
10 ms |
5576 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
13 ms |
5576 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
11 ms |
5608 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
10 ms |
5608 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
75 ms |
5620 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
9 ms |
5620 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
58 ms |
5652 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
69 ms |
5652 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
76 ms |
5724 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
24 ms |
5724 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
18 ms |
5724 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
31 ms |
5724 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
10 ms |
6288 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
10 ms |
6304 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
81 ms |
6304 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
10 ms |
6304 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
85 ms |
6380 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
72 ms |
6380 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
101 ms |
6380 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
103 ms |
6380 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
23 ms |
6428 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
39 ms |
6428 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
27 ms |
13892 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
17 ms |
13912 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
152 ms |
14032 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
17 ms |
14032 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
104 ms |
14100 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
119 ms |
14120 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
123 ms |
14204 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
101 ms |
14204 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
114 ms |
14208 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
137 ms |
14208 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
96 ms |
89884 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
104 ms |
90112 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
1867 ms |
90540 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
120 ms |
91160 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1882 ms |
91284 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
1339 ms |
91476 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
1375 ms |
92096 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
889 ms |
92332 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
1326 ms |
92708 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
1392 ms |
93060 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
