// hmmm... na dige chizi baraye goftan namoonde
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) x.begin(), x.end()
#define pb push_back
#define fi first
#define se second
const int maxn5 = 1e5 + 10;
const int maxk = 203;
const ll inf = 1e18;
struct __cht{
int sz, pt;
pair <pair<ll, int>, pair<ll, ll>> a[maxn5]; // {{start, ind}, {const, shib}}
void clear(){
sz = pt = 0;
}
ll inter(pair<ll, ll> a, pair<ll, ll> b){
if(a.se == b.se)
return a.fi > b.fi ? inf : -inf;
return (a.fi - b.fi) / (b.se - a.se) + ((a.fi - b.fi) % (b.se - a.se) > 0);
}
void add(ll c, ll s, int id){
while(sz && inter(a[sz - 1].se, {c, s}) <= a[sz - 1].fi.fi)
sz--;
a[sz] = {{-inf, id}, {c, s}};
if(sz)
a[sz].fi.fi = inter(a[sz - 1].se, a[sz].se);
sz++;
}
pair<ll, int> get_max(ll x){
while(pt + 1 < sz && a[pt + 1].fi.fi <= x)
pt++;
return {a[pt].se.fi + a[pt].se.se * x, a[pt].fi.se};
}
} cht;
ll ps[maxn5], dp[2][maxn5];
int par[maxk][maxn5];
bool mark[maxn5];
int main(){
ios_base::sync_with_stdio(false); cin.tie(0);
int n, k; cin >> n >> k;
for(int i = 0; i < n; i++){
int a; cin >> a;
ps[i] = a + (i ? ps[i - 1] : 0);
}
for(int t = 1; t <= k; t++){
cht.clear();
cht.add(0, 0, -1);
for(int i = 0; i < n; i++){
auto tmp = cht.get_max(ps[i]);
dp[t&1][i] = tmp.fi;
par[t][i] = tmp.se;
cht.add(dp[(t&1)^1][i] - ps[i] * ps[i], ps[i], i);
}
}
cout << dp[k&1][n - 1] << endl;
int v = n - 1, t = k;
while(t){
if(par[t][v] == -1)
break;
cout << par[t][v] + 1 << ' ';
v = par[t][v];
mark[v] = true;
t--;
}
for(int i = 0; i < n && t; i++) if(!mark[i]){
cout << i + 1 << ' ';
t--;
}
cout << endl;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
3412 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
2 ms |
3412 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
2 ms |
3412 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
2 ms |
3412 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
2 ms |
3464 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
2 ms |
3412 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
2 ms |
3412 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
2 ms |
3412 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
2 ms |
3412 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
2 ms |
3412 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
2 ms |
3464 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
2 ms |
3412 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
2 ms |
3412 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
2 ms |
3412 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
2 ms |
3412 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
2 ms |
3412 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
2 ms |
3412 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
3412 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
2 ms |
3412 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
2 ms |
3668 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
2 ms |
3412 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
2 ms |
3468 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
2 ms |
3412 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
2 ms |
3540 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
2 ms |
3412 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
2 ms |
3412 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
2 ms |
3540 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
3412 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
2 ms |
3412 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
3 ms |
4436 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
2 ms |
3412 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
3 ms |
4052 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
3 ms |
4308 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
3 ms |
4436 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
2 ms |
3668 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
2 ms |
3540 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
2 ms |
3668 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
3412 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
2 ms |
3412 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
6 ms |
5128 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
3 ms |
3412 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
8 ms |
5124 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
5 ms |
4948 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
6 ms |
5204 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
5 ms |
5128 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
2 ms |
3796 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
3 ms |
4180 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
3796 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
3 ms |
3796 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
42 ms |
12348 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
3 ms |
3796 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
26 ms |
8940 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
32 ms |
9728 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
37 ms |
10272 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
27 ms |
8924 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
31 ms |
9760 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
38 ms |
11504 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
13 ms |
6996 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
13 ms |
7192 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
413 ms |
84664 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
16 ms |
7508 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
409 ms |
84364 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
308 ms |
60824 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
323 ms |
65008 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
258 ms |
54052 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
288 ms |
61008 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
373 ms |
76772 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
