#include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);cerr.tie(0)
#define mp make_pair
#define xx first
#define yy second
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define all(x) x.begin(),x.end()
#define ff(i,a,b) for (int i = a; i < b; i++)
#define fff(i,a,b) for (int i = a; i <= b; i++)
#define bff(i,a,b) for (int i = b-1; i >= a; i--)
#define bfff(i,a,b) for (int i = b; i >= a; i--)
using namespace std;
long double typedef ld;
unsigned int typedef ui;
long long int typedef li;
pair<int,int> typedef pii;
pair<li,li> typedef pli;
pair<ld,ld> typedef pld;
vector<vector<int>> typedef graph;
unsigned long long int typedef ull;
//const int mod = 998244353;
const int mod = 1000000007;
//Note to self: Check for overflow
int a[100005];
li pre[100005];
li dp[2][100005];
int gde[204][100005];
li cost(int l, int r)
{
return (pre[r]-pre[l-1])*(pre[r]-pre[l-1]);
}
void conq(int l, int r, int optl, int optr, bool cur, int k)
{
if (l>r) return;
int mid=(l+r)/2;
dp[cur][mid]=(1ll<<61);
int opt;
fff(i,optl,min(mid-1,optr))
{
li sta=dp[!cur][i]+cost(i+1,mid);
if (sta<dp[cur][mid]){
dp[cur][mid]=sta;
opt=i;
}
}
//cout<<k<<" "<<mid<<": "<<opt<<endl;
gde[k][mid]=opt;
conq(l,mid-1,optl,opt,cur,k);
conq(mid+1,r,opt,optr,cur,k);
}
void rekurz(int k, int n)
{
if (k<2) return;
rekurz(k-1,gde[k][n]);
cout<<gde[k][n]<<" ";
}
int main()
{
int n,k; cin>>n>>k; k++;
fff(i,1,n) cin>>a[i];
fff(i,1,n) pre[i]=pre[i-1]+a[i];
bool cur=0;
fff(i,1,n) dp[cur][i]=cost(1,i);
fff(j,2,k) cur=!cur,conq(j,n,j-1,n,cur,j);
li sum=0;
fff(i,1,n) sum+=a[i];
cout<<(sum*sum-dp[cur][n])/2<<"\n";
rekurz(k,n);
}
//Note to self: Check for overflow
/*
7 3
4 1 3 4 0 2 3
7 6
4 1 3 4 0 2 3
4
-1 0
1 0
0 1
0 2
*/
Compilation message
sequence.cpp: In function 'void conq(int, int, int, int, bool, int)':
sequence.cpp:69:9: warning: 'opt' may be used uninitialized in this function [-Wmaybe-uninitialized]
69 | conq(mid+1,r,opt,optr,cur,k);
| ~~~~^~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
340 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 |
304 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
304 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 |
340 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
304 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 |
340 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
304 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 |
340 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 |
1 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 |
340 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 |
432 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 |
308 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
2 ms |
1364 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
304 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
2 ms |
980 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
2 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 |
1 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 |
340 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
6 ms |
1948 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
9 ms |
2004 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
7 ms |
1748 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
8 ms |
2004 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
5 ms |
2004 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
3 ms |
792 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
4 ms |
980 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
724 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
3 ms |
720 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
53 ms |
9264 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
4 ms |
724 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
70 ms |
5784 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
65 ms |
6672 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
60 ms |
7108 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
39 ms |
5832 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
58 ms |
6612 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
73 ms |
8392 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
32 ms |
4172 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
32 ms |
4280 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
554 ms |
81788 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
34 ms |
4684 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1217 ms |
81472 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
754 ms |
57976 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
618 ms |
62156 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
442 ms |
51068 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
610 ms |
58176 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
801 ms |
73756 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
