#include <bits/stdc++.h>
#define x first
#define y second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MXN = 100001, MXK = 202;
int N, K, s[2], e[2], stk[MXN][2], back[MXN][MXK];
ll sum[MXN], dp[MXN][2];
double cross(int x, int y, int z) {
x = stk[x][z % 2], y = stk[y][z % 2];
if (sum[x] == sum[y]) return -1e18;
ll vx = -sum[N] * sum[x] + dp[x][z % 2], vy = -sum[N] * sum[y] + dp[y][z % 2];
return 1.0 * (vy - vx) / (sum[x] - sum[y]);
}
void insert(int x, int z) {
int zz = z % 2;
stk[e[zz]][zz] = x;
while (e[zz] > 1 && cross(e[zz] - 2, e[zz] - 1, z) > cross(e[zz] - 1, e[zz], z))
stk[e[zz] - 1][zz] = stk[e[zz]][zz], e[zz]--;
e[zz]++;
}
void query(int x, int z) {
z--;
int zz = z % 2;
while (s[zz] + 1 < e[zz] && stk[s[zz]][zz] < x - 1 && cross(s[zz], s[zz] + 1, z) <= sum[x])
s[zz]++;
int y = stk[s[zz]][zz];
if (x <= y) { dp[x][(z + 1) % 2] = -1e18; return; }
dp[x][(z + 1) % 2] = (sum[N] - sum[x]) * (sum[x] - sum[y]) + dp[y][z % 2];
back[x][z + 1] = y;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin >> N >> K; K++;
for (int i = 1; i <= N; ++i) {
ll n; cin >> n;
sum[i] = sum[i - 1] + n;
}
insert(0, 0);
for (int k = 1; k <= K; ++k) {
s[(k - 1) % 2] = e[k % 2] = 0;
for (int i = k; i <= N; ++i) {
//dp[i][k] = max(dp[i][k], dp[j][k - 1] + (sum[N] - sum[i]) * (sum[i] - sum[j]));
query(i, k);
insert(i, k);
}
}
cout << dp[N][K % 2] << '\n';
int cur = back[N][K], cnt = K - 1;
stack<int> st;
while (cnt) {
st.push(cur);
cur = back[cur][cnt];
cnt--;
}
while (!st.empty()) {
cout << st.top() << ' ';
st.pop();
}
cout << '\n';
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
0 ms |
332 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
332 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
460 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 |
460 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
3 ms |
460 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
2 ms |
460 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 |
460 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1100 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
1100 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
11 ms |
1100 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
1100 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
12 ms |
1156 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
11 ms |
1152 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
13 ms |
1160 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
10 ms |
1100 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
4 ms |
1100 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
6 ms |
1100 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
9 ms |
8524 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
8 ms |
8500 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
114 ms |
8548 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
7 ms |
8476 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
86 ms |
8520 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
96 ms |
8536 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
104 ms |
8548 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
75 ms |
8524 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
88 ms |
8644 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
110 ms |
8540 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
80 ms |
82296 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
66 ms |
82372 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
1183 ms |
82500 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
66 ms |
82372 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1369 ms |
82336 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
961 ms |
82336 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
1064 ms |
82484 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
797 ms |
82480 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
870 ms |
82416 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
1102 ms |
82408 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
