Submission #1109897

#TimeUsernameProblemLanguageResultExecution timeMemory
1109897ozner77Rice Hub (IOI11_ricehub)C++17
0 / 100
3 ms848 KiB
#include <bits/stdc++.h> using namespace std; int besthub(int R,int L,int X[],long long B){ vector<int> V(L+1,0); long long ans=0; long long res=1; for(int i=0;i<R;i++){ V[X[i]]++; } for(int i=1;i<=B;i++){ ans+=V[i]; } long long maxsum=ans; for(int i=B+1;i<=L;i++){ ans-=V[i-B]; ans+=V[i]; if(ans>maxsum){ res=i; maxsum=ans; } } return res; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...