Submission #19,910

19910

2025-12-29 13:03:43

cpp17

Accepted 40/40

35ms

1076 KiB

#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n, p;
    cin >> n >> p;

    vector<int> alap(n);
    for(int &x : alap){
        cin >> x;
    }

    vector<int> pref(n + 1);
    for(int i = 1; i <= n; i++){
        pref[i] = pref[i - 1] + alap[i - 1];
    }

    int ans = 0;

    for(int i = 0; i < n; i++){
        int l = i, r = n - 1;
        int ind = -1;

        while(l <= r){
            int k = (l + r) / 2;

            int ert = pref[k + 1] - pref[i];

            if(p >= ert){
                ind = k;
                l = k + 1;
            } else{
                r = k - 1;
            }
        }

        if(ind == -1) continue;

        ans = max(ans, ind - i + 1);
    }

    cout << ans << "\n";
}

	Sum	Test	Verdict		Time	Memory
base	40/40
		1	Accepted	0/0	1ms	316 KiB
		2	Accepted	0/0	35ms	1076 KiB
		3	Accepted	2/2	1ms	316 KiB
		4	Accepted	2/2	1ms	316 KiB
		5	Accepted	2/2	1ms	316 KiB
		6	Accepted	2/2	1ms	316 KiB
		7	Accepted	2/2	1ms	316 KiB
		8	Accepted	3/3	1ms	316 KiB
		9	Accepted	3/3	2ms	316 KiB
		10	Accepted	3/3	2ms	316 KiB
		11	Accepted	3/3	2ms	368 KiB
		12	Accepted	3/3	16ms	608 KiB
		13	Accepted	3/3	21ms	644 KiB
		14	Accepted	3/3	18ms	944 KiB
		15	Accepted	3/3	28ms	1020 KiB
		16	Accepted	3/3	28ms	1020 KiB
		17	Accepted	3/3	32ms	1016 KiB