제출 #1334108

#제출 시각아이디문제언어결과실행 시간메모리
1334108abdiskiosk쌀 창고 (IOI11_ricehub)C++20
큐에 대기중
0 ms0 KiB
//
// Created by Oscar Stougaard on 09/03/2026.
//
using namespace std;

#include <vector>
#include <algorithm>
#include <iostream>

int besthub(int r, int l, int* x, long long b) {
    int ghigh = 0;
    for (int i = 0; i < r; i++) {
        int lhigh = 0;
        for (int j = i; j < r; j++) {
            int c = x[j] - x[i];
            if (c <= b) {
                lhigh = max(lhigh, (j - i) + 1);
            }
        }
        ghigh = max(lhigh, ghigh);
    }

    cout << ghigh << endl;
    return 0;
}