Submission #551660

#TimeUsernameProblemLanguageResultExecution timeMemory
551660ala2Rice Hub (IOI11_ricehub)C++14
0 / 100
210 ms444 KiB
#include "ricehub.h" #include <iostream> using namespace std; int n,d; int a[1000100]; int f(int i,int j) { int x=(i+j)/2; x=a[x]; int g=0; for(int o=i;o<=j;o++) g+=abs(a[o]-x); return g; } int besthub(int R, int L, int X[], long long B) { n=R; d=L; for(int i=0;i<n;i++) a[i]=X[i]; int mx=1; for(int i=0;i<n;i++) { for(int j=i+1;j<n;j++) { if(f(i,j)<=B); mx=max(mx,j-i+1); } } int ann=mx; //cout<<mx<<endl; return ann; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...