Submission #16400

#TimeUsernameProblemLanguageResultExecution timeMemory
16400cometRice Hub (IOI11_ricehub)C++98
100 / 100
33 ms4988 KiB
#include <stdio.h> #include <stdlib.h> #include "ricehub.h" typedef long long ll; int max(int x,int y){return x>y?x:y;} int besthub(int N, int Eyfa, int X[], long long B){ X[N]=X[N-1]; int l=0,r=0,mid=0,ret=0; ll sum=0; bool ok=0; while(r<N){ while(r<N&&sum<=B){ if(ok)mid++; r++; sum+=X[r]-X[mid]; //printf("%d %d (%d) : %d\n",l,r,mid,sum); ok=!ok; ret=max(ret,r-l); } while(sum>B){ if(ok)mid++; sum-=X[mid]-X[l]; l++; ok=!ok; } } return ret; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...