#include "bits/stdc++.h"
using namespace std;
#define forR(i, a) for(int i = 0; (i) < (a); ++(i))
#define REP(i, a, b) for(int i = (a); (i) < (b); ++i)
#define all(a) a.begin(), a.end()
#define boost() cin.sync_with_stdio(0); cin.tie(0)
#define printArr(arr) for(int asdfg : arr) cout << asdfg << ' '; cout << '\n'
#define open(x) freopen(((string) x + ".in").c_str(), "r", stdin); freopen(((string) x + ".out").c_str(), "w", stdout);
typedef long long ll;
typedef long double ld;
struct pii{ll a, b;};
struct tii{ll a, b, c;};
bool operator <(pii a, pii b){ return a.a < b.a || a.a == b.a && a.b < b.b;}
struct line{int m; ll b; int i;
ll operator ()(ll x){return m*x + b;}
};
ll intx(line& a, line& b){
return (b.b-a.b)/(a.m-b.m);
}
const int MN = 1e5 + 10, MK = 210;
int s[MN];
line pre[MN];
int rem[MN][MK];
signed main(){
int n, k; cin >> n >> k;
forR(i, n) cin >> s[i];
REP(i, 1, n) s[i] += s[i-1];
forR(g, k + 1){
deque<line> lin = {{0, 0, -1}};
forR(i, n){
while(lin.size() > 1 && lin[1](s[i]) >= lin[0](s[i])) lin.pop_front();
ll ans = lin[0](s[i]);
rem[i][g] = lin[0].i;
if(g == k && i == n - 1){
cout << ans << '\n';
for(int cur = i, j = k; j >= 1; cur=rem[cur][j--]) {
cout << rem[cur][j] + 1 << " \n"[j == 1];
}
break;
}
int si = lin.size();
if(lin[si-1].m == pre[i].m){
if(lin[si-1].b <= pre[i].b) lin.pop_back();
else {
pre[i] = {s[i], (ll) -s[i] * s[i] + ans};
continue;
}
}
si = lin.size();
for(; si > 1 && intx(lin[si-1], pre[i]) <= intx(lin[si-2], lin[si-1]); si=lin.size()) lin.pop_back();
lin.push_back(pre[i]);
pre[i] = {s[i], (ll) -s[i] * s[i] + ans, i};
}
}
}
Compilation message
sequence.cpp: In function 'bool operator<(pii, pii)':
sequence.cpp:14:63: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
14 | bool operator <(pii a, pii b){ return a.a < b.a || a.a == b.a && a.b < b.b;}
| ~~~~~~~~~~~^~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
0 ms |
212 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
0 ms |
468 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
2 ms |
468 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
1108 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
1076 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
7 ms |
1180 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
8 ms |
1108 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
7 ms |
1180 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
8 ms |
1108 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
9 ms |
1108 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
3 ms |
1108 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
4 ms |
1108 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
7 ms |
8788 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
6 ms |
8916 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
87 ms |
8916 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
9 ms |
8916 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
52 ms |
8972 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
56 ms |
8788 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
65 ms |
8924 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
52 ms |
8916 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
62 ms |
8788 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
74 ms |
8788 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
61 ms |
86092 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
56 ms |
86456 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
808 ms |
86896 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
72 ms |
86928 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
883 ms |
86604 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
648 ms |
86336 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
698 ms |
86860 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
552 ms |
86732 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
598 ms |
86600 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
703 ms |
86568 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
