#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define f first
#define s second
#define REP(i,n) for (int i = 0; i<n; ++i)
#ifdef BALBIT
#define bug(...) cerr<<"#"<<__LINE__<<": "<<#__VA_ARGS__<<": ", _do(__VA_ARGS__)
template<typename T> void _do(T && x){cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T && x, S&&...y){cerr<<x<<", "; _do(y...);}
#define IOS()
#else
#define IOS() ios::sync_with_stdio(0), cin.tie(0)
#define endl '\n'
#define bug(...)
#endif // BALBIT
#define SZ(x) (int)(x.size())
#define ALL(x) (x).begin(), (x).end()
#define pb push_back
struct line{
ll m,b;
int id;
line(ll m, ll b, int id): m(m), b(b), id(id){}
};
double its(line a, line b){
if (a.m == b.m) return (a.b > b.b? -1 : -1 ) * (1e18+1029);
return (b.b-a.b) / (double)(a.m-b.m);
}
deque<line>dq[203];
int frm[100005][203];
ll ps[100005];
void add(int k, int i, ll dp) {
line td ((ll)2*ps[i], -(dp + ps[i] * ps[i]), i);
// Everything is inverted for max hull
while (SZ(dq[k]) >= 2) {
if (td.m == dq[k].back().m && td.b <= dq[k].back().b) return;
if (its(td, dq[k].back()) <= its(dq[k].back(), dq[k][SZ(dq[k]) - 2])) {
dq[k].pop_back(); bug("popp");
}else break;
}
dq[k].pb(td);
bug(k, SZ(dq[k]));
}
pair<ll, int> qu(int k, int p) {
while (SZ(dq[k]) >= 2 && (its(dq[k][0], dq[k][1])) <= p) {
dq[k].pop_front(); bug("pop");
}
return {-(dq[k][0].m * p + dq[k][0].b), dq[k][0].id};
}
signed main(){
IOS();
int n,K; cin>>n>>K; ++K;
assert(K >= 2);
for (int i = 0; i<n; ++i) {
cin>>ps[i+1]; ps[i+1] += ps[i];
}
// memset(dp, 0x3f, sizeof dp);
// dp[0][0] = 0;
// line (i,k) should be (ps[i], -(dp[i][k] + ps[i]^2), i)
add(0,0,0);
ll DP = -1;
for (int i=1;i<=n;++i) {
//// vector<pair<int, ll> > toadd;
for (int k=K; k>=1; --k){
if (k > i) continue;
pair<ll, int> q = qu(k-1,ps[i]);
q.f += ps[i] * (ll)ps[i];
frm[i][k] = q.s;
assert(q.s < i);
if (i == n && k == K) {
DP = q.f;
}else
add(k,i,q.f);
bug(i,k,q.f,q.s);
}
// for (int i = SZ(toadd)-1; i>=0; --i) {
// add(k,toadd[i].f, toadd[i].s);
// }
}
// bug(dp[n][K]);
cout<<(ps[n]*ps[n] - DP) / 2<<endl;
int at = frm[n][K];
for (int k = K-1; k>0; --k) {
cout<<at<<' ';
at = frm[at][k];
}
cout<<endl;
}
/*
7 3
4 1 3 4 0 2 3
*/
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
5 ms |
640 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
4 ms |
512 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
4 ms |
512 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
4 ms |
512 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
4 ms |
512 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
4 ms |
512 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
5 ms |
512 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
640 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
5 ms |
692 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
6 ms |
768 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
5 ms |
640 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
5 ms |
640 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
6 ms |
640 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
6 ms |
640 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
5 ms |
640 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
5 ms |
640 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
5 ms |
640 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
1280 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
5 ms |
1408 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
14 ms |
1408 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
5 ms |
1280 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
13 ms |
1408 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
12 ms |
1408 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
16 ms |
1408 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
12 ms |
1664 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
8 ms |
1408 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
9 ms |
1408 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
10 ms |
8960 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
10 ms |
9028 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
104 ms |
9980 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
10 ms |
8960 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
67 ms |
9848 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
76 ms |
9312 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
92 ms |
9860 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
78 ms |
10104 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
76 ms |
9760 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
106 ms |
9848 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
65 ms |
84600 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
67 ms |
84856 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
1157 ms |
95352 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
72 ms |
85752 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1110 ms |
93832 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
790 ms |
89080 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
1018 ms |
94176 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
843 ms |
93560 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
812 ms |
93176 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
1016 ms |
93740 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
