#include <bits/stdc++.h>
using namespace std;
#define int long long
#define sp << ' ' <<
#define nl << '\n'
deque<array<int, 3>> hull[200+1];
int f(int x, int i, int j){
if(j<0) j += hull[i].size();
return hull[i][j][0]*x + hull[i][j][1] - x*x;
}
bool bad(int m, int c, int i){
int x1 = c-hull[i][0][1];
int d1 = hull[i][0][0]-m;
if(d1<0) d1 *= -1LL, x1 *= -1LL;
c = hull[i][1][1], m = hull[i][1][0];
int x2 = c-hull[i][0][1];
int d2 = hull[i][0][0]-m;
if(d2<0) d2 *= -1LL, x2 *= -1LL;
return x1*d2 >= x2*d1;
}
signed main(){
ios_base::sync_with_stdio(false); cin.tie(nullptr);
int n, k; cin >> n >> k;
int a[n], ans = 0, ind = 0;
for(int &i : a) cin >> i;
for(int i=n-2; i>=0; --i) a[i] += a[i+1];
hull[0].push_back({a[0], 0});
int32_t p[n][k];
for(int i=1; i<n; ++i){
for(int j=k-1; j>=0; --j){
if(hull[j].empty()) continue;
while(hull[j].size()>1 and f(a[i], j, -2) >= f(a[i], j, -1)) hull[j].pop_back();
int dp = f(a[i], j, -1);
p[i][j] = hull[j].back()[2];
int m = a[i];
while(!hull[j+1].empty()){
if(hull[j+1][0][0]==m){
dp = max(dp, hull[j+1][0][1]);
hull[j+1].pop_front();
}else if(hull[j+1].size() > 1 and bad(m, dp, j+1)){
hull[j+1].pop_front();
}else break;
}
hull[j+1].push_front({m, dp, i});
if(dp >= ans){
ans = dp;
ind = i;
}
}
}
// for(auto i : hull[1]) cout << i[2] nl;
vector<int> res = {ind};
for(int j=k-1; j>=0; --j){
res.push_back(p[ind][j]);
ind = res.back();
}
cout << ans nl;
for(int i=res.size()-2; i>=0; --i) cout << res[i] << ' ';
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 ms |
620 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
504 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
492 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 |
492 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
492 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 |
492 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
2 ms |
620 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
2 ms |
620 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
2 ms |
620 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
2 ms |
620 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
492 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 |
492 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
13 ms |
1388 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
12 ms |
1388 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
11 ms |
1280 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
14 ms |
1388 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
12 ms |
1644 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
4 ms |
748 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
9 ms |
896 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
1132 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
3 ms |
1132 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
164 ms |
10092 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
4 ms |
1132 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
97 ms |
6624 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
105 ms |
6892 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
137 ms |
7852 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
109 ms |
6912 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
137 ms |
7276 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
150 ms |
8940 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
27 ms |
5868 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
28 ms |
6252 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
1872 ms |
94724 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
30 ms |
7404 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1822 ms |
92776 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
1244 ms |
64620 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
1549 ms |
73820 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
1176 ms |
61932 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
1287 ms |
68972 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
1719 ms |
84844 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
