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"
#include<algorithm>
#include<iostream>
using namespace std;
long long x[200000];
long long su[200000];
long long pat(long long l,long long r)
{
long long mid=(l+r)/2;
return (mid-l+1)*x[mid]+su[l]-x[l]+su[r]-(r-mid)*x[mid]-2*su[mid];
}
int besthub(int R, int L, int X[], long long B)
{
for(int r=0;r<R;r++)
{
x[r]=X[r];
if(r==0)
su[r]=x[r];
else
su[r]=su[r-1]+x[r];
}
int l=0;
int an=-1;
long long q;
for(int r=0;r<R;r++)
{
q=pat(l,r);
while(q>B)
{
l++;
q=pat(l,r);
}
q=pat(l,r);
an=max(an,r-l+1);
}
return an;
}
# | 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... |