| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 696773 | vjudge1 | Holiday (IOI14_holiday) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e5+5,B=1e9;
int n,s,d,a[N],b[N],num,rt[N];
ll ans,c[N];
struct Segment_Tree
{
#define mid ((l+r)>>1)
int ls[N<<5],rs[N<<5],cnt[N<<5];
ll sum[N<<5];
void modify(int &p,int q,int l,int r,int x)
{
p=++num;
ls[p]=ls[q],rs[p]=rs[q];
cnt[p]=cnt[q]+1;sum[p]=sum[q]+x;
if(l==r) return;
(x<=mid)?modify(ls[p],ls[q],l,mid,x):modify(rs[p],rs[q],mid+1,r,x);
}
ll query(int p,int q,int l,int r,int k)
{
if(k<=0) return 0;
if(l==r) return (ll)l*min(k,cnt[q]-cnt[p]);
int rc=cnt[rs[q]]-cnt[rs[p]];
if(k<=rc) return query(rs[p],rs[q],mid+1,r,k);
return sum[rs[q]]-sum[rs[p]]+query(ls[p],ls[q],l,mid,k-rc);
}
#undef mid
}T;
void solve(int l,int r,int L,int R)
{
if(l>r) return;
int mid=(l+r)>>1,p=-1;
for(int i=L;i<=R;i++)
{
ll val=T.query(rt[mid-1],rt[i],0,B,d-(i-mid+s-mid));
if(val>c[mid]) c[mid]=val,p=i;
}
ans=max(ans,c[mid]);
solve(l,mid-1,L,p);solve(mid+1,r,p,R);
}
void solve()
{
num=0;
for(int i=1;i<=n;i++) T.modify(rt[i],rt[i-1],0,B,a[i]),c[i]=0;
solve(1,s,s,n);
}
int main()
{
scanf("%d%d%d",&n,&s,&d);s++;
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
solve();reverse(a+1,a+n+1);s=n+1-s;solve();
printf("%lld\n",ans);
return 0;
}