Submission #31243

#TimeUsernameProblemLanguageResultExecution timeMemory
3124314kgRice Hub (IOI11_ricehub)C++11
100 / 100
29 ms5020 KiB
#include "ricehub.h" #define f(x,y) (long long)(in[y+1]-in[(x+y)/2+1-(y-x+1)%2]) int besthub(int n, int max_L, int in[], long long B){ int x=0, y=0, out=0; long long sum=0; while(x<n){ while(y+1<n && sum+f(x,y)<=B) sum+=f(x,y), y++; out=out>y-x+1?out:y-x+1; sum-=(long long)(in[(x+y)/2+1-(y-x+1)%2]-in[x]), x++; } return out; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...