147362025-01-30 17:16:33PKBLeghosszabb nyaralás (75 pont)cpp17Accepted 75/7525ms808 KiB
#include <iostream>
#include <vector>
using namespace std;

int main() {
    int N, P;
    cin >> N >> P;
    vector<int> prices(N);

    for (int i = 0; i < N; i++) {
        cin >> prices[i];
    }

    int max_days = 0, current_sum = 0;
    int left = 0;

    for (int right = 0; right < N; right++) {
        current_sum += prices[right];

        while (current_sum > P) {
            current_sum -= prices[left];
            left++;
        }

        max_days = max(max_days, right - left + 1);
    }

    cout << max_days << endl;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base75/75
1Accepted0/01ms512 KiB
2Accepted0/025ms748 KiB
3Accepted3/31ms316 KiB
4Accepted3/31ms316 KiB
5Accepted3/31ms500 KiB
6Accepted3/31ms316 KiB
7Accepted3/31ms376 KiB
8Accepted4/41ms316 KiB
9Accepted4/41ms316 KiB
10Accepted5/51ms500 KiB
11Accepted5/53ms316 KiB
12Accepted5/53ms316 KiB
13Accepted7/717ms800 KiB
14Accepted7/720ms564 KiB
15Accepted7/725ms800 KiB
16Accepted8/824ms804 KiB
17Accepted8/825ms808 KiB