Submission #922134

#TimeUsernameProblemLanguageResultExecution timeMemory
922134tamir1Rice Hub (IOI11_ricehub)C++14
0 / 100
5 ms860 KiB
#include "ricehub.h" #include<bits/stdc++.h> #define ll long long using namespace std; ll ans=1,cur,i,sz=1,med,fi=1; int besthub(int R, int L, int X[], long long B) { for(i=1;i<R;i++){ sz++; if(sz%2==1){ cur+=(X[i]-X[med]); } else{ cur+=(X[med+1]-X[med]); med++; cur+=(X[i]-X[med]); } while(cur>B){ sz--; fi++; if(sz%2==1){ cur-=(X[med]-X[fi]); } else{ cur+=(X[med+1]-X[med]); med++; cur-=(X[med]-X[fi]); } } ans=max(ans,sz); } 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...