217422026-01-13 18:51:46TaxiradioFolyóparti telkek (40 pont)cpp17Accepted 40/4032ms1964 KiB
// Source: https://usaco.guide/general/io

#include <algorithm>
#include <bits/stdc++.h>
using namespace std;

#define int int64_t

int32_t main() {
	int n , m; cin >> n >> m;
    vector<int> a;
    int l = -1 , c = 0 , ans = 0;
    for(int r = 0;r < n; r++){
        int x; cin >> x;
        c+=x;
        a.push_back(x);
        while(c > m){
            l++;
            c-=a[l];
        }
        ans = max(ans , r-l);
    }
    cout << ans << endl;
}
SubtaskSumTestVerdictTimeMemory
base40/40
1Accepted0/01ms316 KiB
2Accepted0/032ms1956 KiB
3Accepted2/21ms508 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms500 KiB
6Accepted2/21ms316 KiB
7Accepted2/21ms316 KiB
8Accepted3/32ms316 KiB
9Accepted3/32ms316 KiB
10Accepted3/32ms316 KiB
11Accepted3/32ms316 KiB
12Accepted3/314ms1140 KiB
13Accepted3/318ms1204 KiB
14Accepted3/317ms1580 KiB
15Accepted3/325ms1700 KiB
16Accepted3/324ms1336 KiB
17Accepted3/328ms1964 KiB