#include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
#define forinc(a,b,c) for(int a=b,_c=c;a<=_c;++a)
#define fordec(a,b,c) for(int a=b,_c=c;a>=_c;--a)
#define forv(a,b) for(auto&a:b)
#define pb push_back
#define db double
#define pii pair<int,int>
#define fi first
#define se second
const int N=100010;
int n,k,a[N],tr[N][210],top;
ll s[N],f[N],p[N],g[N];
db lef[N];
int st[N];
vector<int> kq;
db giao(int u,int v)
{
return 1.0*(g[v]-g[u])/(s[v]-s[u]);
}
void add(int i,int j)
{
if(top>=0&&s[i-1]==s[st[top]]) --top;
while(top>=1&&lef[top]<=giao(i-1,st[top])) --top;
st[++top]=i-1;lef[top]=giao(st[top],st[top-1]);
}
main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
//freopen("sequence.inp","r",stdin);
cin>>n>>k;
forinc(i,1,n) cin>>a[i],s[i]=s[i-1]+a[i];
forinc(i,1,n) p[i]=s[n]-s[i];
forinc(j,1,k)
{
top=-1;
forinc(i,j,n-1)
{
add(i,j);
int l=1,r=top,o=0;
while(l<=r)
{
int mid=(l+r)/2;
if(lef[mid]>p[i]) o=mid,l=mid+1;
else r=mid-1;
}
f[i]=-p[i]*s[st[o]]+g[st[o]]+p[i]*s[i];
tr[i][j]=st[o];
}
forinc(i,j,n-1) g[i]=f[i];
}
int I=0,J=k;
forinc(i,k,n-1) if(f[i]>=f[I]) I=i;
cout<<f[I]<<"\n";
while(J)
{
kq.pb(I);
I=tr[I][J],J--;
}
reverse(kq.begin(),kq.end());
forv(x,kq) cout<<x<<" ";
}
Compilation message
sequence.cpp:29:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
main()
^
# |
Verdict |
Execution time |
Memory |
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 |
376 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 |
376 KB |
contestant found the optimal answer: 900320000 == 900320000 |
11 |
Correct |
2 ms |
380 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 |
380 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 |
# |
Verdict |
Execution time |
Memory |
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 |
376 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
4 |
Correct |
2 ms |
376 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 |
376 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
8 |
Correct |
2 ms |
380 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 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 610590000 == 610590000 |
2 |
Correct |
2 ms |
604 KB |
contestant found the optimal answer: 311760000 == 311760000 |
3 |
Correct |
3 ms |
632 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 |
Correct |
2 ms |
632 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
6 |
Correct |
3 ms |
504 KB |
contestant found the optimal answer: 107630884 == 107630884 |
7 |
Correct |
3 ms |
632 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
8 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 193556962 == 193556962 |
9 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
10 |
Correct |
2 ms |
632 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
1272 KB |
contestant found the optimal answer: 21503404 == 21503404 |
2 |
Correct |
3 ms |
1272 KB |
contestant found the optimal answer: 140412195 == 140412195 |
3 |
Correct |
8 ms |
1272 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 |
Correct |
3 ms |
1272 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 |
Correct |
9 ms |
1272 KB |
contestant found the optimal answer: 679388326 == 679388326 |
6 |
Correct |
8 ms |
1272 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
7 |
Correct |
9 ms |
1272 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
8 |
Correct |
8 ms |
1272 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
9 |
Correct |
4 ms |
1272 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
10 |
Correct |
5 ms |
1272 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
10 ms |
9080 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
2 |
Correct |
10 ms |
9080 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
3 |
Correct |
85 ms |
9124 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
4 |
Correct |
10 ms |
9080 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
5 |
Correct |
64 ms |
9080 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
6 |
Correct |
86 ms |
9132 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
7 |
Correct |
78 ms |
9128 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
8 |
Correct |
73 ms |
9112 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
9 |
Correct |
68 ms |
9080 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
10 |
Correct |
84 ms |
9080 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
104 ms |
87032 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
2 |
Correct |
100 ms |
87080 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
3 |
Correct |
1229 ms |
87264 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
4 |
Correct |
83 ms |
87800 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
5 |
Correct |
1590 ms |
87248 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
6 |
Correct |
1248 ms |
87312 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
7 |
Correct |
1752 ms |
87800 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
8 |
Correct |
1946 ms |
87660 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
9 |
Correct |
1488 ms |
87544 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
10 |
Correct |
1753 ms |
87672 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |