#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second.first
#define rd second.second
#define mp(a,b,c) make_pair(a,make_pair(b,c))
using ii = pair<long long,pair<long long,int>>;
const int N=100010;
int n,k,it;
long long ma;
int a[N];
long long s[N],x[N];
vector<int> ans;
int cur;
int P[210][N];
long long F[N],H[N];
ii st[N];
double G[N];
double I(ii u,ii v){return 1.0*(v.se-u.se)/(u.fi-v.fi);}
main()
{
ios_base::sync_with_stdio(false),cin.tie(nullptr);
cin>>n>>k;
for(int i=1;i<=n;++i) cin>>a[i],s[i]=s[i-1]+a[i];
for(int i=1;i<=n;++i) x[i]=s[n]-s[i];
for(int c=1;c<=k;++c)
{
cur=0;
for(int i=c;i<n;++i)
{
ii T=mp(-s[i-1],H[i-1],i-1);
if(cur && st[cur].fi==T.fi) cur--;
while(cur>=2 && G[cur]<=I(st[cur],T)) cur--;
st[++cur]=T;
G[cur]=I(st[cur],st[cur-1]);
int l=2,m,r=cur,o=1;
while(l<=r)
{
m=(l+r)/2;
if(G[m]>=x[i]) o=m,l=m+1;
else r=m-1;
}
F[i]=(st[o].fi+s[i])*x[i] + st[o].se;
P[c][i]=st[o].rd;
}
for(int i=c;i<n;++i) H[i]=F[i];
}
for(int i=k;i<n;++i) if(ma<=F[i]) ma=F[i],it=i;
for(;k>0;k--) ans.push_back(it),
it=P[k][it];
cout<<ma<<"\n";
reverse(ans.begin(),ans.end());
for(auto i:ans) cout<<i<<" ";
}
Compilation message
sequence.cpp:23:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
main()
^
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
2 ms |
248 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
2 ms |
380 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
2 ms |
632 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
2 ms |
348 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
3 ms |
1400 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
9 ms |
1144 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
3 ms |
1272 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
3 ms |
1400 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
2 ms |
636 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
2 ms |
508 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
2 ms |
760 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
7 ms |
2168 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
9 ms |
2168 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
8 ms |
1856 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
9 ms |
2168 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
8 ms |
2168 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
4 ms |
764 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
5 ms |
1144 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
4 ms |
1144 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
4 ms |
1144 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
75 ms |
9720 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
4 ms |
1308 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
62 ms |
6264 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
83 ms |
7016 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
76 ms |
7540 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
70 ms |
6308 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
64 ms |
7032 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
82 ms |
8944 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
24 ms |
7544 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
26 ms |
7544 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
878 ms |
85372 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
25 ms |
8184 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1128 ms |
84820 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
1014 ms |
61296 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
873 ms |
65756 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
862 ms |
54904 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
954 ms |
61796 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
922 ms |
77204 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
