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 <bits/stdc++.h>
using namespace std;
#define ll long long
#define f first
#define s second
#define pf push_front
#define pb push_back
#define pi pair<int,int>
#define vi vector<int>
/*
int besthub(int n, int last, int x[], ll b){
int ans = 0;
int l , r;
for(int i = 0; i < n; i++){
l = i - (lower_bound(x.begin(), x.end(), max(0LL,x[i]-b))- x.begin());
r = upper_bound(x.begin(), x.end(), min((ll) last, x[i]+b)) - x.begin() - (i+1);
// cout << x[i] << " " <<l << " " << r << endl;
ans = max(l+r+1,ans);
}
return ans;
}
*/
int besthub(int n, int last, int x[], ll b){
ll ans = 0;
ll cnt;
int pref[n];
pref[0] = 0;
for(int i = 1; i < n; i++){
// cout << i << " "<< x[i] << " " << x[i-1]<<endl;
pref[i] = pref[i-1] + (x[i]-x[i-1]);
}
ll l = 0, r =0;
ll final = 1;
while(r<n && l<n){
// cout <<"COr " << l << " " << r << endl;
//cout << pref[l] << " " << pref[r]<<endl;
if(pref[r]-pref[l]<= b){
// cout << l << " " << r << endl;
final = max(final,r-l+1);
r++;
}
else{
while(pref[r]-pref[l]>b && l<r){
l++;
}
}
}
return final;
}
Compilation message (stderr)
ricehub.cpp: In function 'int besthub(int, int, int*, long long int)':
ricehub.cpp:34:8: warning: unused variable 'ans' [-Wunused-variable]
34 | ll ans = 0;
| ^~~
ricehub.cpp:36:8: warning: unused variable 'cnt' [-Wunused-variable]
36 | ll cnt;
| ^~~
# | 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... |