제출 #232075

#제출 시각아이디문제언어결과실행 시간메모리
232075chubyxdxdRice Hub (IOI11_ricehub)C++17
100 / 100
23 ms1920 KiB
#include "ricehub.h" #include <bits/stdc++.h> using namespace std; int besthub(int R, int L, int X[], long long B) { long long int i=0,j=0,curr=0,mi=0,num=1,ans=1; while(j<R){ if(curr>B){ curr-=(X[mi]-X[i]); i++; if(num%2==1){ mi++; } num--; } else{ j++; curr+=(X[j]-X[mi]); ans=max(ans,num); if(num%2==1){ mi++; } num++; } } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...