#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
int besthub(int R, int L, int X[], long long B)
{
vector<int>v;
long long ps[R];
for(int i=0; i<R; i++){
//v.push_back(X[i]);
ps[i]=X[i];
if(i>0){
ps[i]+=ps[i-1];
}
}
int l=0,r=R;
int bati=0;
while(l<=r){
int mid=(l+r)/2;
long long ans=1e18;
for(int i=0; i<R; i++){
long long ans1=0;
for(int j=i; j<i+mid; j++){
ans1+=abs(X[i+(mid+1)/2-1]-X[j]);
}
ans=min(ans,ans1);
}
if(ans>B){
r=mid-1;
}
else{
l=mid+1;
}
}
return r;
}
# | 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... |