189872025-11-13 20:01:44MagyarKendeSZLGFolyóparti telkek (40 pont)cpp17Accepted 40/4013ms1592 KiB
#include <bits/stdc++.h>
using namespace std;
#define int int64_t

int32_t main() {
    cin.tie(0), ios::sync_with_stdio(0);
    int n, p;
    cin >> n >> p;
    vector<int> a(n);
    for (int& x : a) cin >> x;
    int l = 0, r = 0, sum = 0, result = 0;
    while (r < n) {
        while (r < n && sum + a[r] <= p) sum += a[r++];
        result = max(result, r - l);
        sum -= a[l++];
    }
    cout << result << "\n";
}
SubtaskSumTestVerdictTimeMemory
base40/40
1Accepted0/01ms316 KiB
2Accepted0/013ms1592 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted2/21ms424 KiB
8Accepted3/31ms316 KiB
9Accepted3/31ms316 KiB
10Accepted3/31ms316 KiB
11Accepted3/32ms472 KiB
12Accepted3/36ms820 KiB
13Accepted3/38ms1076 KiB
14Accepted3/38ms1080 KiB
15Accepted3/310ms1524 KiB
16Accepted3/310ms1332 KiB
17Accepted3/312ms1332 KiB