Submission #234947

#TimeUsernameProblemLanguageResultExecution timeMemory
234947Nodir_Bobiev쌀 창고 (IOI11_ricehub)C++17
68 / 100
1095 ms2304 KiB
#include "ricehub.h" #include <bits/stdc++.h> using namespace std; int besthub(int R, int L, int X[], long long B) { int ans = 0; long long sumL[R+2]={}, sumR[R+2]={}; for( int i = 1; i <= R; i ++ ){ sumL[i] = sumL[i-1] + X[i-1]; } for( int i = R; i >= 1; i -- ){ sumR[i] = sumR[i+1] + X[i-1]; } for( int i = 1; i <= R; i ++ ){ int l = 1, r = R+1; while( r - l > 1 ){ int m = ( l + r ) >> 1; long long mn = 1e18; for( int j = max(i-m+1,1); j <= min(i,R-m+1); j++){ int k = j + m-1; mn = min(mn, X[i-1]*1ll*(i-j+1)-(sumL[i]-sumL[j-1]) + (sumR[i]-sumR[k+1])-X[i-1]*1ll*(k-i+1) ); } if( mn <= B ) l = m; else r = m; } ans = max(l, ans); } 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...