231772026-01-16 16:07:03Erik_GepardFolyóparti telkek (40 pont)cpp17Accepted 40/4012ms820 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<int> ar(n);
    for(int i=0; i<n; i++){
        cin>>ar[i];
    }
    int legjobb=0;
    int j=0;
    int sum=0;
    for(int i=0; i<n; i++){
        sum+=ar[i];
        while(sum>p){
            sum-=ar[j];
            j++;
        }
        legjobb=max(legjobb, i-j+1);
    }
    cout<<legjobb<<"\n";

    return 0;
}
SubtaskSumTestVerdictTimeMemory
base40/40
1Accepted0/01ms316 KiB
2Accepted0/012ms820 KiB
3Accepted2/22ms316 KiB
4Accepted2/22ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted2/22ms500 KiB
8Accepted3/31ms368 KiB
9Accepted3/31ms316 KiB
10Accepted3/31ms316 KiB
11Accepted3/31ms376 KiB
12Accepted3/36ms576 KiB
13Accepted3/37ms756 KiB
14Accepted3/37ms580 KiB
15Accepted3/39ms580 KiB
16Accepted3/38ms748 KiB
17Accepted3/39ms568 KiB