#include <bits/stdc++.h>
using namespace std;
#define int long long
int dp[201][100001];
int pre[100001];
int ind[201][100001];
struct cht {
vector<pair<int, pair<int, int>>> v;
int cur = 0;
long double is(int a, int b, int c, int d) {
return (long double)(d - b) / (a - c);
}
void add(int m, int c, int num) {
if (v.size() && v.back().first == m && v.back().second.first > c) return;
while (v.size() - cur > 1) {
int s = v.size();
if ((v[s - 1].first == m && c > v[s - 1].second.first) || (is(v[s - 1].first, v[s - 1].second.first, m, c) <= is(v[s - 2].first, v[s - 2].second.first, m, c))) v.pop_back();
else break;
}
v.push_back({m, {c, num}});
}
pair<int, int> query(int x) {
while (v.size() - cur > 1) {
if (v[cur].first * x + v[cur].second.first < v[cur + 1].first * x + v[cur + 1].second.first) cur++;
else break;
}
return {v[cur].first * x + v[cur].second.first, v[cur].second.second};
}
};
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
int a; cin >> a;
pre[i] = pre[i - 1] + a;
}
for (int i = 1; i <= k; i++) {
cht hull;
for (int j = i; j < n; j++) {
if (i == 1) {
dp[i][j] = pre[j] * (pre[n] - pre[j]);
ind[i][j] = j;
continue;
}
hull.add(pre[j - 1], dp[i - 1][j - 1], j - 1);
pair<int, int> c = hull.query(pre[j] - pre[n]);
dp[i][j] = c.first + pre[j] * pre[n] - pre[j] * pre[j];
ind[i][j] = c.second;
}
}
pair<int, int> ans = {INT_MIN, INT_MIN};
for (int i = k; i < n; i++) {
ans = max(ans, {dp[k][i], i});
}
cout << ans.first << '\n';
vector<int> v;
int cur = ans.second;
v.push_back(cur);
for (int i = k; i >= 2; i--) {
cur = ind[i][cur];
v.push_back(cur);
}
for (int i = k - 1; i >= 0; i--) {
cout << v[i] << " ";
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
8540 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 |
2 ms |
8540 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
2 ms |
16732 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
4564 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
2 ms |
8540 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
2 ms |
8536 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
8540 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 ms |
8540 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
8540 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
8540 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
2 ms |
8540 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
8540 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
8660 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
8540 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
8540 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
24 ms |
78428 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
5 ms |
8744 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
3 ms |
16732 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
2 ms |
12636 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
5 ms |
41308 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
3 ms |
20828 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
2 ms |
12644 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
3 ms |
24932 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
8540 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
8540 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
9 ms |
69980 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
8540 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
9 ms |
73308 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
9 ms |
75868 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
10 ms |
74076 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
8 ms |
70060 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
6 ms |
45404 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
8 ms |
70236 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
8540 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
2 ms |
8540 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
13 ms |
76124 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
2 ms |
8540 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
15 ms |
79944 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
13 ms |
77404 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
15 ms |
86244 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
15 ms |
84060 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
8 ms |
66140 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
11 ms |
81256 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
9056 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
2 ms |
9052 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
87 ms |
102200 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
3 ms |
9320 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
50 ms |
84932 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
60 ms |
89876 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
68 ms |
92068 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
57 ms |
87524 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
63 ms |
90340 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
79 ms |
95204 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
13 ms |
15224 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
15 ms |
14112 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Runtime error |
322 ms |
131072 KB |
Execution killed with signal 9 |
| 4 |
Halted |
0 ms |
0 KB |
- |
