Submission #431512

#TimeUsernameProblemLanguageResultExecution timeMemory
431512Bill_00Rice Hub (IOI11_ricehub)C++14
0 / 100
6 ms576 KiB
#include "ricehub.h" #include <bits/stdc++.h> using namespace std; long long sum[100000]; int besthub(int R, int L, int X[], long long B) { for(int i=0;i<R;i++){ if(i==0) sum[i]=X[i]; else sum[i]=sum[i-1]+X[i]; } int ans=0; for(int i=0;i<R;i++){ int l=i,r=R-1; while(l<r){ int m=(l+r+1)>>1; int x=i-1+(m-i+1)/2; int y=m+1-(m-i+1)/2; if(B>=(sum[m]-sum[y]+X[y]-sum[x]+sum[i]-X[x])){ l=m; } else r=m-1; } ans=max(ans,l-i+1); } 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...