Submission #234941

#TimeUsernameProblemLanguageResultExecution timeMemory
234941Nodir_BobievRice Hub (IOI11_ricehub)C++17
42 / 100
1097 ms896 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 ++ ){ for( int j = 1; j <= i; j ++ ){ for( int k = i; k <= R; k ++ ){ if(X[i-1]*(i-j+1)-(sumL[i]-sumL[j-1]) + (sumR[i]-sumR[k+1])-X[i-1]*(k-i+1)<=B){ ans = max( ans, k-j+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...