#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e5;
int n,k,idx=1,a[N+5],pre[N+5],bef1[N+5][205];
vector <int> bef(N+5),dp(N+5);
int 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,ans=-1e18,pos=0;
for (int i=min(optr,md);i>=optl;--i){
int 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;
}
}
int 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(long long int, long long int, long long int, long long int)':
sequence.cpp:12:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
12 | int md=l+r>>1,ans=-1e18,pos=0;
| ~^~
sequence.cpp: In function 'void Solve()':
sequence.cpp:49:24: warning: 'pos' may be used uninitialized in this function [-Wmaybe-uninitialized]
49 | 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 |
1880 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 |
1880 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 |
1840 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 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 |
1884 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 |
1884 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
1880 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 |
2140 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
2 ms |
2140 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
1 ms |
2304 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 |
2 ms |
3420 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
2 ms |
3420 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
4 ms |
3676 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
2 ms |
3420 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
7 ms |
3420 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
5 ms |
3420 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
5 ms |
3680 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
4 ms |
3676 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
3 ms |
3676 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
3 ms |
3420 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
9 ms |
18012 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
7 ms |
18060 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
67 ms |
18272 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
8 ms |
18264 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
51 ms |
18080 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
57 ms |
18264 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
46 ms |
18280 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
36 ms |
18264 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
45 ms |
18012 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
62 ms |
18268 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
55 ms |
131072 KB |
Execution killed with signal 9 |
| 2 |
Halted |
0 ms |
0 KB |
- |
