# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
655504 | 2022-11-04T15:17:13 Z | PanTkd | 쌀 창고 (IOI11_ricehub) | C++14 | 0 ms | 0 KB |
#include "ricehub.h" #include <iostream> #include <cmath> typedef long long ll; using namespace std; bool ok (ll x, ll R,ll L,ll X[],ll B){ ll i = x; ll cost = 0; ll med = ((i)/2); for(ll j = 0;j<i;j++){ cost += abs(X[med]-X[j]); } if(cost<=B){ return 1;} for(ll j = 1;j<=R-i;j++){ med++; cost += (i/2-(i-1)/2)*(X[med]-X[med-1]); cost += abs(X[med]-X[j+i-1]); cost -= abs(X[med-1]-X[j-1]); if(cost<=B){return 1;} } return 0; } int besthub(int R, int L, int X[], long long B) { ll l = 1 , ll r = R; ll ans = 1; while(l<=r){ ll m = (l+r)>>1; if (ok(m,R,L,X,B)) { ans = max (ans, m); l = m; } else{ r = m - 1; } } return ans; }