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;
typedef long long ll;
long long ma=-1;
int besthub(int R, int L, int X[], long long B){
vector<ll>T;
T.push_back(0);
for(int i=0;i<R;i++){
T.push_back(X[i]+T[T.size()-1]);
}
for(int i=0;i<R;i++){
for(int j=i+1;j<R;j++){
ll mi=(i+j)/2;
if((mi-i)*X[mi]-(T[mi]-T[i])+(T[j+1]-T[mi+1])-(j-mi)*X[mi]<=B){
ma=max(ma,(ll)(j-i)+1);
}
}
}
return ma;
}
# | 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... |