Submission #503129

#TimeUsernameProblemLanguageResultExecution timeMemory
503129jk410Rice Hub (IOI11_ricehub)C++17
68 / 100
15 ms2880 KiB
#include "ricehub.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; int R,L; int X[100001]; ll Sum_X[100001]; ll B; int Ans; ll f(int l,int r){ int m=(l+r)>>1; return X[m]*(m-l)-(Sum_X[m-1]-Sum_X[l-1])+(Sum_X[r]-Sum_X[m])-X[m]*(r-m); } int besthub(int r,int l,int x[],ll b){ R=r; L=l; for (int i=1; i<=R; i++){ X[i]=x[i-1]; Sum_X[i]=Sum_X[i-1]+X[i]; } B=b; for (int i=1,j=1; i<=R; i++){ while (j<R){ if (f(i,j+1)>B) break; j++; } Ans=max(Ans,j-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...