#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) {
assert(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() {}
} cht;
ll n, k, pref[N], dp[N][2];
int bt[N][205];
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];
}
ll ans = -1, ind;
for(int j = 1; j <= k; j ++) {
cht.inits();
if(j == 1) {
cht.adds({0,0},0);
}
for(int i = 1; i < j; i ++) {
swap(dp[i][0],dp[i][1]);
cht.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.query(pref[i])+pref[n]*pref[i]-pref[i]*pref[i];
bt[i][j] = cht.ind[cht.ft];
if(j == k && ans < dp[i][1]) {
ind = i;
ans = dp[i][1];
}
if(j > 1) {
cht.adds({pref[i],-pref[n]*pref[i]+dp[i][0]},i);
}
}
}
assert(ind >= k);
assert(ans != -1);
vector<int> pt;
int K = k;
while(K) {
pt.push_back(ind);
ind = bt[ind][K--];
}
assert(!K);
cout << ans << "\n";
sort(pt.begin(),pt.end());
for(int i: pt) cout << i << " ";
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
2 ms |
4444 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
2 ms |
4444 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
2 ms |
4444 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
4520 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
4696 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
2 ms |
4444 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
4700 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
4520 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
2 ms |
4700 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
4700 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
1 ms |
4700 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Incorrect |
2 ms |
4700 KB |
Integer 0 violates the range [1, 199] |
| 7 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
6748 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
6748 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
7 ms |
6748 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
6748 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
6 ms |
6788 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
6 ms |
6748 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
7 ms |
6748 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
6 ms |
6748 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
2 ms |
6748 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
4 ms |
6748 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
3 ms |
12892 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
3 ms |
12892 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
68 ms |
12952 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
3 ms |
12892 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
41 ms |
12928 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
45 ms |
12892 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
59 ms |
12892 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
41 ms |
12888 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
48 ms |
12892 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
62 ms |
12924 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
33 ms |
84816 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
20 ms |
84824 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
711 ms |
84828 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
22 ms |
85072 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
686 ms |
84824 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
502 ms |
84900 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
630 ms |
85076 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
441 ms |
84984 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
503 ms |
85072 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
643 ms |
84944 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
