#include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<ll,null_type,less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> order_set;
mt19937 mt_rand(chrono::high_resolution_clock::now().time_since_epoch().count());
//uniform_int_distribution<int> gen; ///(min, max)
//int random() {return gen(mt_rand);}
const int mxN=1e5+1;
const int mod=998244353;
const int mxlogN=40;
const int mxK=26;
const ll inf=1e18;
const int K=600;
ll dp[mxN], dp2[mxN], a[mxN], p[mxN];
ll cost(int l, int r)
{
if(l>r) return 0;
return (p[r]-p[l])*(p[r]-p[l]);
}
int pos[200][mxN];
void solve(int l, int r, int optl, int optr, int layer)
{
if(l>r) return;
int m=(l+r)/2, opt=m-1;
ll best=dp[m];
for(int k=optl; k<=min(m-1,optr); k++)
{
ll cur=dp[k]+cost(k,m);
if(cur<=best)
{
best=cur;
opt=k;
}
}
dp2[m]=best;
pos[layer][m]=opt;
solve(l,m-1,optl,opt,layer);
solve(m+1,r,opt,optr,layer);
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k; cin >> n >> k;
for(int i=1; i<=n; i++) cin >> a[i];
for(int i=1; i<=n; i++) p[i]=a[i]+p[i-1];
for(int i=1; i<=n; i++) dp[i]=p[i]*p[i];
for(int i=0; i<k; i++)
{
solve(1,n,1,n,i);
for(int i=1; i<=n; i++) dp[i]=dp2[i];
}
cout << (p[n]*p[n]-dp[n])/2 << "\n";
vector<int> ans;
int x=n;
while(~--k)
{
ans.push_back(pos[k][x]);
x=pos[k][x];
}
reverse(ans.begin(),ans.end());
for(int i:ans) cout << i << " ";
cout << "\n";
}
/*
7 3
4 1 3 4 0 2 3
*/
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
340 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 |
340 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
368 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
356 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
340 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
340 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 |
340 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
2 ms |
1408 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
2 ms |
1108 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
3 ms |
1236 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
2 ms |
1364 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
2 ms |
596 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
1 ms |
596 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
10 ms |
2056 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
11 ms |
2024 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
7 ms |
1848 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
11 ms |
2004 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
8 ms |
2004 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
3 ms |
724 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
5 ms |
980 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
724 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
4 ms |
724 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
255 ms |
9384 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
4 ms |
724 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
124 ms |
5872 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
65 ms |
6792 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
70 ms |
7180 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
48 ms |
5964 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
56 ms |
6736 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
92 ms |
8512 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
25 ms |
4800 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
23 ms |
4816 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
702 ms |
82176 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
25 ms |
5048 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
896 ms |
81960 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
527 ms |
58380 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
657 ms |
62580 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
491 ms |
51568 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
516 ms |
58556 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
712 ms |
74224 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
