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<bits/stdc++.h>
using namespace std;
int n,a[100005];
long long b;
bool app(int l,int r){
long long mn=1e18;
for(int i=l;i<=r;i++){
long long cnt=0;
for(int j=l;j<=r;j++)
cnt+=abs(a[j]-a[i]);
mn=min(mn,cnt);
}
return mn<=b;
}
bool check(int x){
bool flag=0;
for(int i=0;i+x-1<n;i++)flag|=app(i,x+i-1);
return flag;
}
int besthub(int N,int L,int A[],long long B){
n=N;b=B;
for(int i=0;i<n;i++)a[i]=A[i];
int l=1,r=n,m;
while(l<r){
m=(l+r+1)>>1;
if(check(m))l=m;
else r=m-1;
}
return l;
}
# | 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... |