233322026-01-19 17:46:29abcdFolyóparti telkek (40 pont)cpp17Accepted 40/4029ms784 KiB
#include <bits/stdc++.h>
using namespace std;
using pii=pair<int,int>;

int main(){
    int n,p;cin>>n>>p;
    vector<int> ar(n);
    for(int i=0;i<n;i++)cin>>ar[i];
    int l=0,cur=0,ans=0;
    for(int r=0;r<n;r++){
        cur+=ar[r];
        while(cur>p){
            cur-=ar[l];l++;
        }
        ans=max(ans,r-l+1);
    }
    cout<<ans<<'\n';
}
SubtaskSumTestVerdictTimeMemory
base40/40
1Accepted0/01ms316 KiB
2Accepted0/029ms760 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms412 KiB
7Accepted2/21ms316 KiB
8Accepted3/31ms316 KiB
9Accepted3/31ms316 KiB
10Accepted3/32ms368 KiB
11Accepted3/32ms504 KiB
12Accepted3/313ms564 KiB
13Accepted3/317ms652 KiB
14Accepted3/314ms692 KiB
15Accepted3/321ms764 KiB
16Accepted3/321ms764 KiB
17Accepted3/326ms784 KiB