#include <bits/stdc++.h>
using namespace std;
class bag {
private:
class line {
public:
long long m, b;
int j;
line(long long mm, long long bb, int id) {
m = mm;
b = bb;
j = id;
}
long double taq(const line& d) const {
return (long double) (d.b - b) / (long double) (m - d.m);
}
};
int I;
vector<pair<line, long double>> stk;
public:
bag() {
I = 0;
}
void insert_line(long long b, long long m, long long id) {
line d(m, b, id);
while (stk.size() > 1 && ((stk.back().first.m == m && stk.back().first.b <= b) || stk.back().second <= d.taq(stk.back().first))) {
stk.pop_back();
}
if (!stk.empty() && stk.back().first.m == m) {
if (stk.back().first.b > d.b) {
d = stk.back().first;
}
stk.pop_back();
}
stk.push_back({d, (stk.empty() ? LLONG_MAX : d.taq(stk.back().first))});
}
pair<long long, int> eval(long long x) {
I = min(I, (int) stk.size() - 1);
while (I < (int) stk.size() && (long double) x < stk[I].second) {
I++;
}
if (I >= (int) stk.size()) {
I = stk.size() - 1;
}
if (x >= stk[I].second) {
I--;
}
line d = stk[I].first;
return pair<long long, int>(d.m * x + d.b, d.j);
}
};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<long long> sum(n);
sum[0] = a[0];
for (int i = 1; i < n; i++) {
sum[i] = a[i] + sum[i - 1];
}
vector<long long> sr(n);
sr[n - 1] = a[n - 1];
for (int i = n - 2; i >= 0; i--) {
sr[i] = a[i] + sr[i + 1];
}
vector<long long> dp(n);
vector<vector<int>> en(k + 1, vector<int>(n, -1));
for (int i = 0; i < n; i++) {
dp[i] = (sum[n - 1] - sum[i]) * (sum[i]);
}
for (int i = 2; i <= k; i++) {
vector<long long> new_dp(n, 0);
bag chL;
chL.insert_line(dp[i - 2], sr[i - 1], i - 2);
for (int j = i - 1; j + 1 < n; j++) {
pair<long long, int> fromCh = chL.eval(sr[j + 1]);
new_dp[j] = fromCh.first - sr[j + 1] * sr[j + 1];
en[i][j] = fromCh.second;
chL.insert_line(dp[j], sr[j + 1], j);
}
swap(dp, new_dp);
}
pair<long long, int> p = {-1, -1};
for (int i = 0; i + 1 < n; i++) {
p = max(p, {dp[i], i});
}
cout << p.first << '\n';
int ptr = p.second;
for (int i = k; i > 0; i--) {
cout << ptr + 1 << " ";
assert(en[i][ptr] < ptr);
ptr = en[i][ptr];
}
cout << '\n';
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
308 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
304 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
312 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
312 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
312 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
308 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
204 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
316 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
308 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
2 ms |
460 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
2 ms |
460 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
2 ms |
436 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
2 ms |
460 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
2 ms |
316 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
9 ms |
1228 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
10 ms |
1100 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
9 ms |
1100 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
10 ms |
1252 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
9 ms |
1244 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
3 ms |
588 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
5 ms |
716 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
4 ms |
1504 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
4 ms |
1508 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
184 ms |
9988 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
4 ms |
2044 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
81 ms |
6192 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
88 ms |
6960 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
127 ms |
8024 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
101 ms |
6740 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
125 ms |
7612 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
145 ms |
9184 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
27 ms |
15172 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
27 ms |
15436 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
1699 ms |
94224 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
36 ms |
16704 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1806 ms |
92988 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
677 ms |
65716 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
1468 ms |
74444 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
1096 ms |
63380 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
1213 ms |
70068 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
1573 ms |
85736 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
