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;
bool price(int X[], int l,int r, long long B){
int i;
long long p = 0;
int m = (r + l) / 2;
for(i = l; i <m ; i++){
p +=(long long)(X[m] - X[i]);
}
for(i = m + 1; i <=r ; i++){
p +=(long long)(X[i] - X[m]);
}
if(p <= B){
return 1;
} else {
return 0;
}
}
int besthub(int n, int L, int X[], long long B)
{
int l = 0, r = 0, m,dif = -1,i;
for(i = 0; i < n;i++){
l = i; r = n ;
while(l + 1 != r){
m = (l+r) / 2;
if(price(X,i,m,B)){
l = m;
} else {
r = m;
}
}
dif = max(dif , r - i);
}
return dif;
}
# | 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... |