#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll pre[100005];
ll a[100005];
ll dp[100005];
ll dpp[100005];
int prosli[100005][205];
struct line{
ll a, b;
int ind;
ll eval(ll x){
return a*x+b;
}
};
line seg[400005];
void upd(int node, int l, int r, line g){
int mid = (l+r)/2;
if(g.eval(pre[l]) >= seg[node].eval(pre[l]) && g.eval(pre[r]) >= seg[node].eval(pre[r])){
seg[node] = g;
return;
}
if(l == r) return;
if(g.eval(pre[l]) > seg[node].eval(pre[l]) || g.eval(pre[mid]) > seg[node].eval(pre[mid])) upd(node*2, l, mid, g);
if(g.eval(pre[r]) > seg[node].eval(pre[r]) || g.eval(pre[mid+1]) > seg[node].eval(pre[mid+1])) upd(node*2+1, mid+1, r, g);
}
pair <int, ll> query(int node, int l, int r, int x){
pair <int, ll> res1 = {seg[node].ind, seg[node].eval(pre[x])};
if(l == r) return res1;
int mid = (l+r)/2;
pair <int, ll> res2;
if(x <= mid) res2 = query(node*2, l, mid, x);
else res2 = query(node*2+1, mid+1, r, x);
if(res1.second >= res2.second) return res1;
else return res2;
}
void init(int node, int l, int r){
if(l == r){
seg[node].a = -100000;
seg[node].b = -1000000000000000LL;
seg[node].ind = 0;
return;
}
int mid = (l+r)/2;
init(node*2, l, mid);
init(node*2+1, mid+1, r);
}
int main(){
ios_base::sync_with_stdio(false), cin.tie(0);
int n, k;
cin >> n >> k;
for(int i=1; i<=n; i++){
cin >> a[i];
pre[i] = pre[i-1] + a[i];
}
for(int j=1; j<=k; j++){
init(1, 1, n);
for(int i=1; i<=n; i++){
pair <int, ll> d = query(1, 1, n, i);
dp[i] = d.second;
prosli[i][j] = d.first;
line nline;
nline.a = pre[i];
nline.b = -pre[i]*pre[i] + dpp[i];
nline.ind = i;
upd(1, 1, n, nline);
}
for(int i=1; i<=n; i++){
dpp[i] = dp[i];
}
}
cout << dp[n] << "\n";
int t = n;
for(int i=k; i>=1; i--){
cout << prosli[t][i] << " ";
t = prosli[t][i];
}
return 0;
}
/*
7 3
4 1 3 4 0 2 3
*/
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 108 == 108 |
2 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 999 == 999 |
3 |
Correct |
0 ms |
364 KB |
contestant found the optimal answer: 0 == 0 |
4 |
Correct |
0 ms |
364 KB |
contestant found the optimal answer: 1542524 == 1542524 |
5 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
6 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1 == 1 |
7 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1 == 1 |
8 |
Correct |
0 ms |
364 KB |
contestant found the optimal answer: 1 == 1 |
9 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 100400096 == 100400096 |
10 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 900320000 == 900320000 |
11 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
12 |
Correct |
0 ms |
364 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
13 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 140072 == 140072 |
14 |
Correct |
0 ms |
364 KB |
contestant found the optimal answer: 376041456 == 376041456 |
15 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 805 == 805 |
16 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 900189994 == 900189994 |
17 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 999919994 == 999919994 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1093956 == 1093956 |
2 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 302460000 == 302460000 |
3 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
4 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
5 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
6 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 933702 == 933702 |
7 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
8 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 687136 == 687136 |
9 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
10 |
Correct |
1 ms |
364 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 610590000 == 610590000 |
2 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 311760000 == 311760000 |
3 |
Correct |
9 ms |
492 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 |
Correct |
1 ms |
492 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 |
Correct |
9 ms |
492 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
6 |
Incorrect |
8 ms |
492 KB |
position 198 occurs twice in split scheme |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
1260 KB |
contestant found the optimal answer: 21503404 == 21503404 |
2 |
Correct |
2 ms |
1260 KB |
contestant found the optimal answer: 140412195 == 140412195 |
3 |
Correct |
58 ms |
1260 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 |
Correct |
2 ms |
1260 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 |
Correct |
80 ms |
1260 KB |
contestant found the optimal answer: 679388326 == 679388326 |
6 |
Correct |
54 ms |
1260 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
7 |
Correct |
60 ms |
1260 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
8 |
Correct |
60 ms |
1260 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
9 |
Correct |
13 ms |
1260 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
10 |
Correct |
26 ms |
1260 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
15 ms |
9452 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
2 |
Correct |
17 ms |
9452 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
3 |
Correct |
838 ms |
9600 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
4 |
Correct |
17 ms |
9484 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
5 |
Correct |
706 ms |
9540 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
6 |
Correct |
574 ms |
9580 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
7 |
Correct |
616 ms |
9540 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
8 |
Correct |
530 ms |
9580 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
9 |
Correct |
614 ms |
9540 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
10 |
Correct |
734 ms |
9540 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
163 ms |
89836 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
2 |
Correct |
155 ms |
89836 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
3 |
Execution timed out |
2096 ms |
89964 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |