144782025-01-11 20:45:27sarminLeghosszabb nyaralás (75 pont)cpp17Runtime error 35/7512ms2008 KiB
#include <bits/stdc++.h>
using namespace std;

int main() {

	ios_base::sync_with_stdio(0);
	cin.tie(0);

	int n, p; cin >> n >> p;
	vector<long long> a(n), prefix(n, 0);
	for (int i = 0; i < n; i++) {
        cin >> a[i];
        if (i == 0) prefix[i] = a[i];
        else prefix[i] = prefix[i - 1] + a[i];
    }

    long long jj = -1, mx = 0;
    for (int i = 0; i < n; i++) {
        long long j = jj, sum = 0;
        if (j != -1) sum = prefix[j] - prefix[i - 1];
        while (j + 1 < n && sum + a[j + 1] <= p) {
            j++;
            sum += a[j];
        }
        if (a[j + 1] > a[j]) {
          jj = max(jj, j);
        } else {
          jj = j + 1;
        }
        mx = max(mx, j - i + 1);
    }
    cout << mx;

	return 0;
}
SubtaskSumTestVerdictTimeMemory
base35/75
1Accepted0/01ms316 KiB
2Runtime error0/012ms1844 KiB
3Wrong answer0/31ms316 KiB
4Accepted3/31ms316 KiB
5Accepted3/31ms424 KiB
6Accepted3/31ms316 KiB
7Accepted3/31ms316 KiB
8Accepted4/41ms316 KiB
9Accepted4/41ms316 KiB
10Accepted5/51ms316 KiB
11Accepted5/52ms580 KiB
12Accepted5/52ms564 KiB
13Runtime error0/78ms2004 KiB
14Runtime error0/79ms2008 KiB
15Runtime error0/712ms1844 KiB
16Runtime error0/810ms2008 KiB
17Runtime error0/810ms1844 KiB