# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
741096 | josanneo22 | Rice Hub (IOI11_ricehub) | C++17 | 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;
#define ll long long
ll n,m,v,a[100005],sum[100005],ans=-1;
bool check(ll l,ll r)
{
ll mid=(l+r)/2;
return ((sum[r]-sum[mid])-(sum[mid-1]-sum[l-1])-a[mid]*((r-l)&1))<=v;//代码核心
//若r-l+1为偶数,即r-l为奇数时,少减了a[mid]。
}
int main()
{
scanf("%lld%lld%lld",&n,&m,&v);
for(ll i=1;i<=n;i++)
{
scanf("%lld",&a[i]);
sum[i]=sum[i-1]+a[i];
}
for(ll l=1,r=0;l<=n;l++)
{
while(r<n&&check(l,r+1))
r++;
ans=max(ans,r-l+1);
}
printf("%lld",ans);
return 0;
}