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 "ricehub.h"
int besthub(int n, int l, int a[], long long b)
{
int ans=0;
long long pre[n+1]={};
for (int i=0;i<n;i++)
pre[i+1]=pre[i]+a[i];
for (int i=0;i<n;i++)
{
int st=0,en=n-i;
while (st+1<en)
{
int mid=(st+en)/2;
long long g=0;
int j=i,k=i+mid/2,l=i+mid;
j++;k++;l++;
g=pre[l]-pre[k]-1ll*a[k-1]*(l-k)+1ll*a[k-1]*(k-j+1)-(pre[k]-pre[j-1]);
if (g<=b)
st=mid;
else
en=mid;
}
ans=(st+1>ans?st+1:ans);
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |