#include<bits/stdc++.h>
#define pll pair<ll, ll>
#define fi first
#define se second
#define ll long long
#define pb push_back
#define ar array
#define vi vector
#define bit(i,x) ((x >> i) & 1ll)
#define all(x) x.begin(),x.end()
#define low(l,r,x) x.begin()+l,x.begin()+r
#define len(l,r) (r-l+1)
#define PI acos(-1.0)
template <class T> void setmin(T &a, T b) { if(b < a) a = b; }
template <class T> void setmax(T &a, T b) { if(b > a) a = b; }
const long long mod = 998244353, N = 1e5, INF = 1e18, Log = 19, MASK = 1 << 19;
using namespace std;
vector<ll> dp_before, dp_cur;
ll pfs[N+5] , perf[N+5];
int n , k;
int trace[205][N+5];
ll C(ll i , ll j) {
ll k = pfs[j] - pfs[i-1];
ll res = k*k;
res -= (perf[j] - perf[i-1]);
return res;
}
void compute(ll x,ll l,ll r, ll optl, ll optr) {
if(l > r) return;
ll mid = (l+r) >> 1;
pll best = {INF,-1};
for(int i = optl; i <= min(mid,optr);i++) {
// best = min(best, {dp_before[i-1] + C(i,mid),i});
if(dp_before[i-1] + C(i,mid) <= best.fi) {
best.fi = dp_before[i-1] + C(i,mid);
best.se = i;
}
}
if(best.se == -1) return;
dp_cur[mid] = best.fi;
trace[x][mid] = best.se - 1;
int opt = best.se;
compute(x,l,mid-1,optl,opt);
compute(x,mid+1,r,opt,optr);
}
void kazuha() {
cin >> n >> k;
ll a[n+5];
pfs[0] = 0;
perf[0] = 0;
for(int i = 1; i <= n;i++) {
cin >> a[i];
pfs[i] = pfs[i-1] + a[i];
perf[i] = perf[i-1] + a[i]*a[i];
}
ll ans = pfs[n]*pfs[n] - perf[n];
dp_cur.assign(n+5,INF);
dp_before.assign(n+5,INF);
dp_before[0] = 0;
dp_cur[0] = 0;
for(int i = 1; i <= k+1;i++) {
compute(i,1,n,1,n);
dp_before = dp_cur;
}
ans = (ans - dp_before[n])/2;
cout << ans << '\n';
ll i = k+1, j = n;
vi<ll> v;
while(trace[i][j]) {
v.push_back(trace[i][j]);
j = trace[i--][j];
}
reverse(all(v));
for(auto u : v) {
cout << u << " ";
}
cout << '\n';
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen("permutation.cpp", "r", stdin);
// freopen("permutation.cpp", "w", stdout);
long long mitsu = 1;
// cin >> mitsu;
for(long long seele = 0; seele < mitsu;seele++) {
// cout << "Case " << seele << " :";
kazuha() ;
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
2392 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
2392 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
2392 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
2396 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
2 ms |
20824 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
0 ms |
4444 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
10588 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
6492 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
2392 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
7 ms |
72284 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
5 ms |
55644 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
6 ms |
66140 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
7 ms |
66140 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
2 ms |
18780 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
12636 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
2 ms |
22876 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
2392 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
9 ms |
70232 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
0 ms |
2396 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
10 ms |
72280 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
8 ms |
68164 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
10 ms |
64348 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
10 ms |
66392 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
3 ms |
16728 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
4 ms |
33116 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
2908 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
2 ms |
2652 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
49 ms |
71504 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
2 ms |
2908 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
37 ms |
50064 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
37 ms |
56148 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
45 ms |
60244 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
31 ms |
50040 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
34 ms |
56156 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
43 ms |
70568 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
20 ms |
6236 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
17 ms |
6236 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
427 ms |
83028 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
16 ms |
6236 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
627 ms |
83040 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
377 ms |
59728 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
462 ms |
63828 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
318 ms |
53560 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
341 ms |
59672 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
436 ms |
76072 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
