Danoninho1.cpp

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int maxn = 1e5 + 5;

int v[maxn];

int32_t main(){
	int n, D; cin >> n >> D;
	for(int i = 0; i < n; i++) cin >> v[i];

	int l = 0, r = 0, val = v[0], ans = 0;
	while(r<n){
		if(val<=D) ans=max(ans, r-l+1), r++, val+=v[r];
		else val-=v[l], l++;
	}

	cout << ans << '\n';
}