제출 #876815

#제출 시각아이디문제언어결과실행 시간메모리
876815JakobZorz쌀 창고 (IOI11_ricehub)C++14
100 / 100
12 ms4528 KiB
#include "ricehub.h" typedef long long ll; int n; int arr[100000]; ll ps[100001]; ll sum; bool is_possible(int num){ int num1=num/2; int num2=(num+1)/2; for(int i=num1;i<=n-num2;i++){ if(num1*arr[i]-(ps[i]-ps[i-num1])-num2*arr[i]+(ps[i+num2]-ps[i])<=sum) return true; } return false; } int besthub(int R,int L,int X[],ll B){ sum=B; n=R; for(int i=0;i<n;i++) arr[i]=X[i]; for(int i=0;i<n;i++) ps[i+1]=ps[i]+arr[i]; int l=1,r=100001; while(l<r-1){ int m=(l+r)/2; if(is_possible(m)) l=m; else r=m; } return l; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...