#include<bits/stdc++.h>
using namespace std;
const int nmax=1e5+42,kmax=2e2+5;
long long dp[2][nmax];
int optimal[kmax][nmax];
int n,k;
int inp[nmax];
long long pref[nmax];
long long ask(int l,int r)
{
return pref[r]-pref[l-1];
}
long long score(int j,int i)
{
return ask(1,j)*ask(j+1,i);
}
int output[nmax];
int brute(int cuts,int i,int lq,int rq)
{
int ret=-1;
dp[cuts&1][i]=-1;
for(int j=lq;j<=rq&&j<i;j++)
{
long long current=dp[(cuts-1)&1][j]+score(j,i);
if(current>dp[cuts&1][i])
{
ret=j;
dp[cuts&1][i]=current;
}
}
//cout<<"brute "<<cuts<<" "<<i<<" "<<lq<<" "<<rq<<" -> "<<ret<<endl;
return ret;
}
void dc(int cuts,int l,int r,int lq,int rq)
{
if(l>r)return;
rq=min(r,rq);
int av=(l+r)/2;
optimal[cuts][av]=brute(cuts,av,lq,rq);
dc(cuts,l,av-1,lq,optimal[cuts][av]);
dc(cuts,av+1,r,optimal[cuts][av],rq);
}
int main()
{
scanf("%i%i",&n,&k);
for(int i=1;i<=n;i++)
{
scanf("%i",&inp[i]);
pref[i]=pref[i-1]+inp[i];
}
for(int cuts=1;cuts<=k;cuts++)
{
for(int j=0;j<=n;j++)
dp[cuts%2][j]=-1e18;
dc(cuts,cuts+1,n,1,n);
//for(int j=1;j<=n;j++)cout<<optimal[cuts][j]<<" ";cout<<endl;
}
printf("%lld\n",dp[k%2][n]);
int pos=n;
for(int cuts=k;cuts>=1;cuts--)
{
output[cuts]=optimal[cuts][pos];
pos=optimal[cuts][pos];
}
for(int i=1;i<=k;i++)
{
printf("%i",output[i]);
if(i==k)printf("\n");
else printf(" ");
}
return 0;
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:63:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%i%i",&n,&k);
~~~~~^~~~~~~~~~~~~~
sequence.cpp:66:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%i",&inp[i]);
~~~~~^~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
5 ms |
640 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
4 ms |
384 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 |
384 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
5 ms |
448 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
4 ms |
384 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
6 ms |
1408 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
6 ms |
1152 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
6 ms |
1280 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
6 ms |
1408 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 |
512 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
5 ms |
640 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
11 ms |
2048 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
5 ms |
384 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
15 ms |
2048 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
14 ms |
1792 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
13 ms |
2048 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
10 ms |
2048 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
7 ms |
768 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
8 ms |
1024 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
7 ms |
768 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
7 ms |
768 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
72 ms |
9336 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
7 ms |
768 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
84 ms |
5880 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
87 ms |
6776 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
75 ms |
7160 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
53 ms |
5880 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
75 ms |
6648 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
94 ms |
8440 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
40 ms |
4216 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
33 ms |
4216 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
769 ms |
81912 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
29 ms |
4728 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1499 ms |
81656 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
928 ms |
58232 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
759 ms |
62328 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
537 ms |
51192 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
775 ms |
58244 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
991 ms |
74056 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
