# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
113203 | ecksdee | Rice Hub (IOI11_ricehub) | C++11 | 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"
#include <bits/stdc++.h>
using namespace std;
int besthub(int R, int L, int X[], int B) {
int maxim[R];
memset(maxim, 1, sizeof(maxim));
for (int i = 0; i < R; i++) {
for (int x = i; x < R; x++) {
if ((maxim[i] + (X[x] - X[i])) < B) {
maxim[i] ++;
}
}
}
sort(maxim, maxim+R, greater<int>());
return maxim[0];
}
int main() {
int R, L, B;
int X[5];
cin >> R >> L >> B;
for (int i = 0; i < R; i++) {
cin >> X[i];
}
cout << besthub(R, L, X, B);
}