# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
552016 | ala2 | Rice Hub (IOI11_ricehub) | C++14 | 14 ms | 2500 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 "ricehub.h"
#include <iostream>
using namespace std;
int n,d;
int a[1000100];
int b;
int P[1001000];
int f(int i,int j)
{
int x=(i+j)/2;
int ta=j-i+1;
int one=P[x]-P[i]+a[i]-a[x];
int g=0;
int ta1=x-i;
g=ta1*a[x]-one;
int tow=P[j]-P[x];
int ta2=j-x;
g+=tow-ta2*a[x];
return g;
}
int ok(int mid)
{
for(int i=0;i<n;i++)
{
if(i+mid>=n)
break;
if(f(i,i+mid)<=b)
{
return 1;
}
}
return 0;
}
int besthub(int R, int L, int X[], long long B)
{
n=R;
d=L;
b=B;
for(int i=0;i<n;i++)
a[i]=X[i];
P[0]=a[0];
for(int i=1;i<n;i++)
P[i]=P[i-1]+a[i];
int mx=1;
int l=0;
int r=n;
while(r-l>1)
{
int mid=(l+r)/2;
if(ok(mid))
{
l=mid;
}
else r=mid;
}
int ann=l+1;
//cout<<mx<<endl;
return ann;
}
Compilation message (stderr)
# | 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... |