#include <bits/stdc++.h>
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " : " << x << '\n'
using namespace std;
typedef long long ll;
typedef long double ld;
typedef string str;
typedef pair<ll, ll> pll;
const ll Mod = 1e9 + 7;
//const ll Inf = 2242545357980376863LL;
const ll Log = 20;
//const ll N = 1ll << Log;
const int Maxn = 1e5 + 10;
//const int Base = 101;
typedef pair<ll, ll> Line;
typedef pair<pair<ll, Line>, int> Ty;
vector<Ty> L;
ll INF = 4e18;
inline ll Intersection(Line X, Line Y){
if (X.first == Y.first && X.second >= Y.second)
return (-INF);
if (X.first == Y.first)
return (INF);
return ((Y.second - X.second) / (X.first - Y.first)) + ((Y.second - X.second) % (X.first - Y.first) > 0);
}
inline void Add(Line X, ll idx){
while(!L.empty() && Intersection(L.back().F.S, X) <= L.back().F.F)
L.pop_back();
L.pb({{(L.empty() ? -INF : Intersection(L.back().F.S, X)), X}, idx});
}
inline pll GetMin(ll X){
auto it = --upper_bound(all(L), Ty({X, {INF, INF}}, INF));// it --;
return pll((X * it->F.S.F + it->F.S.S), it -> S);
}
int a[Maxn];//, mk[Maxn];
ll ps[Maxn];//, sf[Maxn];
ll dp[2][Maxn];
int par[203][Maxn];
vector<ll> A;
int main(){
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
L.reserve(Maxn);
//debug((-3) / 2);
ll n, k;
cin >> n >> k;
for(int i = 0; i < n; i++) cin >> a[i];
ps[0] = 0;
for(int i = 1; i <= n; i++) ps[i] = ps[i - 1] + a[i - 1];
for(int i = 0; i <= n; i++) dp[0][i] = ps[i] * ps[i];
pll res;
int jj;
for(int j = 1; j <= k; j++){
L.clear();
jj = j & 1;
dp[jj][0] = 0;
for(int i = 1; i <= n; i++){
Add( pll(-2LL * ps[i - 1], dp[jj ^ 1][i - 1] + ps[i - 1]*ps[i - 1] ), i - 1);
res = GetMin(ps[i]);
dp[jj][i] = res.F + ps[i]*ps[i];
par[j][i] = res.S;
}
}
cout << ((ps[n] * ps[n]) - dp[k&1][n]) / 2LL << '\n';
ll nw = n;
for(int i = 0; i < k; i++){
nw = par[k - i][nw];
A.pb(nw);
}
reverse(all(A));
for(auto x : A) cout << x << ' ';
cout << '\n';
return 0;
}
/*
7 3
4 1 3 4 0 2 3
*/
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
416 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
640 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
3 ms |
1408 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
0 ms |
384 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
2 ms |
1152 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
3 ms |
1280 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
3 ms |
1408 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
640 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
1 ms |
640 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
484 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
12 ms |
2176 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
12 ms |
2176 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
11 ms |
1920 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
12 ms |
2176 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
12 ms |
2176 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
3 ms |
768 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
5 ms |
1152 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
1024 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
3 ms |
1024 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
119 ms |
9592 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
3 ms |
1024 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
79 ms |
6136 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
101 ms |
6904 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
103 ms |
7468 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
86 ms |
6268 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
92 ms |
7032 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
126 ms |
8764 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
32 ms |
6784 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
32 ms |
6776 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
1314 ms |
85112 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
31 ms |
8056 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1472 ms |
84320 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
1192 ms |
60748 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
1124 ms |
65504 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
992 ms |
54372 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
1022 ms |
61176 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
1320 ms |
76612 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
