| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1003278 | vjudge1 | Rice Hub (IOI11_ricehub) | C++17 | 0 ms | 0 KiB |
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;
ll pref[n+1];
pref[0] = 0;
for(int i = 1; i <= n; i++){
pref[i] = pref[i-1]+x[i-1];
}
if(b>=pref[n]){
return n;
}
/*
for(int i : pref){
cout << i << " ";
}
cout << endl;
*/
int l = 1;
int final = 1;
for(int r =1; r <= n;r++){
int m = (l+r)/2;
// ll val = pref[r] - pref[m] + (pref[m]-pref[max(0,l)]);
ll val= ((x[m-1]*(m-l)) - (pref[m-1]-pref[l-1]) + ((pref[r]-pref[m]) - (x[m-1]*(r-m))));
//cout <<l << " "<< r << " " << val<<endl;
// cout << val << endl;
if( ((x[m-1]*(m-l)) - (pref[m-1]-pref[l-1]) + ((pref[r]-pref[m]) - (x[m-1]*(r-m))))<= b){
// cout << l << " " << r << endl;
final = max(final,r-l+1);
}
else{
while(((x[m-1]*(m-l)) - (pref[m-1]-pref[l-1]) + ((pref[r]-pref[m]) - (x[m-1]*(r-m)))) > b && l<r){
m = (l+r)/2;
l++;
}
m = (l+r)/2;
if(((x[m-1]*(m-l)) - (pref[m-1]-pref[l-1]) + ((pref[r]-pref[m]) - (x[m-1]*(r-m))))<= b){
final = max(final,r-l+1);
}
}
}
return final;
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int r,b,l;
cin >> r >> l>> b;
int v[r];
for(int i = 0; i < r; i++){
cin >> v[i];
}
cout << besthub(r,l,v,b)<<endl;
}