제출 #488666

#제출 시각아이디문제언어결과실행 시간메모리
488666fun_day쌀 창고 (IOI11_ricehub)C++14
25 / 100
1094 ms580 KiB
#include <bits/stdc++.h>
 
using namespace std;

int besthub(int R, int L, int X[] , long long B){
  int best = 0;
  for(int i = 0 ; i < R ; i++){
    int ans = 0;
    long long s = 0;
    int l = i - 1 , r = i + 1;
    while(l >= 0 || r < R){
      if((l < 0) || (r < R && X[r] - X[i] <= X[i] - X[l])){
        s += X[r] - X[i];
        r++;
      }
      else if((r >= R) || (l >= 0 && X[i] - X[l] <= X[r] - X[i])){
        s += X[i] - X[l];
        l--;
      }
      if(s > B) break;
      ans++;
    }
    if(ans >= best) best = ans;
    else break;
  }
  return best + 1;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...