| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1003164 | vjudge1 | Rice Hub (IOI11_ricehub) | C++17 | 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<bits/stdc++.h>
#include "ricehub.h"
#define ll long long
#define ld long double
#define vl vector<ll>
#define vi vector<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define f first
#define s second
#define pb push_back
#define p_b pop_back
using namespace std;
int besthub(int R, int L, int X[], long long B)
{
    int res = 0;
    for(int i = 0; i < R; i++)
    {
        int g = 0;
        for(int j = i; j < R; j++)
        {
            g += (X[j] - X[i]);
            if(g - 1 > B)
                break;
            res = max(res, j - i + 1);
        }
    }
    return res;
}
int main()
{
    int R, L;
    ll B;
    cin >> R >> L >> B;
    int X[R];
    for(int i = 0; i < R; i++)
        cin >> X[i];
    cout << besthub(R, L, X, B) << "\n";
}
