#include <bits/stdc++.h>
using namespace std;
const long long N=1e5;
long long n,k,idx=1,a[N+5],pre[N+5];
int bef1[N+5][205];
vector <long long> bef(N+5),dp(N+5);
long long Cal(int i, int j){
return (pre[j]-pre[i-1])*(pre[n]-pre[j]);
}
void dnc(int l, int r, int optl, int optr){
if (l>r) return;
int md=l+r>>1;
long long ans=-1e18,pos=0;
for (int i=min(optr,md);i>=optl;--i){
long long d=bef[i-1]+Cal(i,md);
if (d>ans){
ans=d;
pos=i;
}
}
dp[md]=ans;
bef1[md][idx]=pos;
dnc(l,md-1,optl,pos);
dnc(md+1,r,pos,optr);
}
void Solve(){
cin>>n>>k;
for (int i=1;i<=n;++i){
cin>>a[i];
pre[i]=pre[i-1]+a[i];
}
for (int i=1;i<=n;++i) bef[i]=Cal(1,i);
for (int i=2;i<=k;++i){
++idx;
dnc(i,n,i,n);
for (int j=1;j<=n;++j){
bef[j]=dp[j];
dp[j]=0;
}
}
long long ans=-1e18,pos;
for (int i=1;i<=n;++i)
if (bef[i]>ans){
ans=bef[i];
pos=i;
}
cout<<ans<<"\n";
for (int i=k;i>=1;--i){
cout<<pos<<' ';
pos=bef1[pos][i]-1;
}
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// freopen ("FILE.INP","r",stdin);
// freopen ("FILE.OUT","w",stdout);
int t=1;
// cin>>t;
while (t--) Solve();
}
Compilation message
sequence.cpp: In function 'void dnc(int, int, int, int)':
sequence.cpp:12:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
12 | int md=l+r>>1;
| ~^~
sequence.cpp: In function 'void Solve()':
sequence.cpp:50:24: warning: 'pos' may be used uninitialized in this function [-Wmaybe-uninitialized]
50 | pos=bef1[pos][i]-1;
| ~~~~~~~~~~~^
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
1884 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
1884 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
1884 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
1884 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
1884 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
1884 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
1884 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
1884 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
1884 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
1884 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
1880 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
2 ms |
1884 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
1884 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
1880 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
1884 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
1884 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
1884 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
1884 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
1884 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
1884 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
1884 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
1884 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
1884 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
1880 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
1884 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
1884 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
1884 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
2140 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
2140 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
1 ms |
2140 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
2140 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
1 ms |
2136 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
1 ms |
2140 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
1 ms |
2140 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
2140 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
2140 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
1 ms |
2140 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
2652 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
2652 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
4 ms |
2648 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
2652 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
5 ms |
2648 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
4 ms |
2652 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
4 ms |
2652 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
3 ms |
2652 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
2 ms |
2652 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
3 ms |
2652 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
4 ms |
10076 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
4 ms |
10076 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
42 ms |
10076 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
4 ms |
10076 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
47 ms |
10212 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
41 ms |
10076 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
40 ms |
10072 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
28 ms |
10072 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
39 ms |
10076 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
46 ms |
10240 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
39 ms |
83792 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
39 ms |
83796 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
441 ms |
83812 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
35 ms |
83796 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
812 ms |
83820 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
489 ms |
84052 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
455 ms |
83796 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
314 ms |
83800 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
421 ms |
83820 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
514 ms |
83804 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
