#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 1e5 + 5;
const int INF = 1e9;
const ll MOD = 1e9 + 7;
ll N, K, A[MAXN], dp[2][MAXN], S[MAXN];
int path[205][MAXN];
struct func {
ll a, b, idx;
double s;
func(ll x, ll y, int z) : a(x), b(y), idx(z) { s = -INF; };
func() {}
ll val(ll x) { return a*x + b; }
};
double cross(func &f, func &g) { return (double)(g.b - f.b) / (double)(f.a - g.a); }
func st[MAXN];
void solve(int k) {
int idx = 0, sz = 0;
for(int i=k+1; i<=N; i++) {
func f(S[i-1], dp[(k+1) % 2][i-1] - S[i-1]*S[i-1], i-1);
bool flag = 0;
while(sz) {
if(f.a == st[sz-1].a) {
if(st[sz-1].b < f.b) sz--, idx = min(idx, sz-1);
else {
flag = 1;
break;
}
}
if(sz == 0) break;
f.s = cross(f, st[sz-1]);
if(f.s > st[sz-1].s) break;
sz--; idx = min(idx, sz-1);
}
if(!flag) st[sz++] = f;
while(idx+1 < sz && st[idx+1].s <= S[i]) idx++;
dp[k%2][i] = st[idx].val(S[i]);
path[k][i] = st[idx].idx;
}
}
int main() {
ios::sync_with_stdio(0); cin.tie(0);
cin >> N >> K;
for(int i=1; i<=N; i++) cin >> A[i], S[i] = S[i-1] + A[i];
for(int k=1; k<=K; k++) solve(k);
cout << dp[K%2][N] << '\n';
vector<int> ans;
int x = N;
for(int k=K; k>=1; k--) ans.push_back(path[k][x]), x = path[k][x];
reverse(ans.begin(), ans.end());
for(auto i : ans) cout << i << ' ';
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
2 ms |
300 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
0 ms |
376 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
2 ms |
380 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
376 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
3 ms |
604 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
2 ms |
476 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
3 ms |
1404 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
3 ms |
1144 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
3 ms |
1272 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
3 ms |
1400 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
2 ms |
632 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
3 ms |
504 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
1 ms |
680 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
2 ms |
380 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
5 ms |
2168 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
2 ms |
508 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
7 ms |
2040 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
6 ms |
1784 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
8 ms |
2168 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
6 ms |
2168 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
3 ms |
764 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
4 ms |
1144 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
1116 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
4 ms |
1144 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
33 ms |
9724 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
4 ms |
1144 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
30 ms |
6136 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
31 ms |
7032 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
37 ms |
7544 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
26 ms |
6292 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
27 ms |
7036 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
34 ms |
8824 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
21 ms |
7332 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
18 ms |
7416 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
280 ms |
85512 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
21 ms |
8312 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
462 ms |
84648 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
309 ms |
61036 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
352 ms |
65960 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
240 ms |
54716 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
235 ms |
61432 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
299 ms |
77176 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
