#include <bits/stdc++.h>
#define N 100005
using namespace std;
typedef long long ll;
struct Line {
ll m,b;
ll get(ll x) {
return m*x+b;
}
long double cross(Line v) {
return 1LL*(b-v.b)/(v.m-m);
}
};
struct CHT {
Line vt[N];
int ind[N];
int ft=0,bk=0;
void adds(Line v, int i) {
while(bk-ft) {
if(vt[bk-1].m == v.m) {
if(v.b < vt[bk-1].b) {
i = ind[bk-1];
v.b = vt[bk-1].b;
}
--bk;
} else {
break;
}
}
while(bk-ft >= 2) {
if(vt[bk-2].cross(v) < vt[bk-2].cross(vt[bk-1])) {
--bk;
} else {
break;
}
}
ind[bk] = i;
vt[bk++] = v;
}
ll query(int x) {
if(bk==ft) return 0;
while(bk-ft>=2) {
if(vt[ft].cross(vt[ft+1]) < x) {
++ft;
} else {
break;
}
}
return vt[ft].get(x);
}
void inits() {
ft = 0, bk = 0;
}
CHT() {}
};
ll n, k, pref[N], dp[N][2];
int bt[N][205];
CHT cht[2];
int main() {
cin.tie(0)->sync_with_stdio(0);
cin >> n >> k;
for(int i = 1; i <= n; i ++) {
cin >> pref[i];
pref[i] += pref[i-1];
}
cht[1].adds({0,0},0);
ll ans = -1, ind;
for(int j = 1; j <= k; j ++) {
swap(cht[0],cht[1]);
cht[1].inits();
for(int i = 1; i < j; i ++) {
swap(dp[i][0],dp[i][1]);
cht[0].adds({pref[i],-pref[n]*pref[i]+dp[i][0]},i);
}
for(int i = j; i <= n; i ++) {
swap(dp[i][0],dp[i][1]);
dp[i][1] = cht[0].query(pref[i])+pref[n]*pref[i]-pref[i]*pref[i];
bt[i][j] = cht[0].ind[cht[0].ft];
if(j == k && ans < dp[i][1]) {
ind = i;
ans = dp[i][1];
}
if(j > 1) {
cht[0].adds({pref[i],-pref[n]*pref[i]+dp[i][0]},i);
}
}
}
vector<int> pt;
int K = k;
while(ind) {
pt.push_back(ind);
ind = bt[ind][K--];
}
cout << ans << "\n";
sort(pt.begin(),pt.end());
for(int i: pt) cout << i << " ";
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:91:21: warning: 'ind' may be used uninitialized in this function [-Wmaybe-uninitialized]
91 | pt.push_back(ind);
| ~~~~~~~~~~~~^~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
8540 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
2 ms |
8540 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
2 ms |
8540 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
3 ms |
8792 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
4 ms |
8580 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
2 ms |
8536 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
2 ms |
8628 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
2 ms |
8540 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
3 ms |
8540 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
3 ms |
8540 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
3 ms |
8540 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
3 ms |
8540 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
3 ms |
8540 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
4 ms |
8540 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
3 ms |
8540 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
3 ms |
8540 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
3 ms |
8536 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
8536 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
3 ms |
8540 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
10 ms |
8540 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
3 ms |
8536 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
4 ms |
8540 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
3 ms |
8660 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
7 ms |
8540 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
4 ms |
8536 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
5 ms |
8744 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
5 ms |
8540 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
8540 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
3 ms |
8540 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
35 ms |
8536 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
3 ms |
8536 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
26 ms |
8752 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Incorrect |
32 ms |
8540 KB |
Unexpected end of file - int32 expected |
| 7 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
10588 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
3 ms |
10816 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
42 ms |
10792 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
3 ms |
10588 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
39 ms |
10796 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
38 ms |
10588 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
42 ms |
10588 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
39 ms |
10584 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
11 ms |
10584 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
19 ms |
10584 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
16984 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
5 ms |
17184 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
105 ms |
16988 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
5 ms |
16988 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
63 ms |
17240 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
78 ms |
17084 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
96 ms |
17244 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
66 ms |
16988 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
75 ms |
17088 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
95 ms |
16988 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
26 ms |
88664 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
28 ms |
89056 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
775 ms |
88888 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
26 ms |
88680 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
755 ms |
88884 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
545 ms |
88668 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
674 ms |
88668 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
481 ms |
88916 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
546 ms |
88884 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
700 ms |
88888 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
