# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
28784 | Nikefor | 쌀 창고 (IOI11_ricehub) | C++98 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "ricehub.h"
int field[10001];
int besthub(int R, int L, int X[], long long B)
{
for(int i=0; i<R; i++) field[ X[i] ]++;
long long optimalGain = 0;
for(int i=0; i<L; i++) {
long long localGain = constraint = 0;
for(int j=1; j<=L, constraint+j<=B; j++) {
if( (i-j) > 0 && field[i-j]) {constraint+=j; localGain+=field[i-j];}
if( (i+j) <= L && field[i+j] && constraint+j<=B) {constraint+=j; localGain+=field[i+j];}
}
if(localGain>optimalGain) optimalGain = localGain;
}
return optimalGain ;
}