题解

#include <iostream>
#include <vector>
using namespace std;

int main() {
int n, t, l = 0, m = 0;
long long s = 0;
cin >> n >> t;
vector<int> a(n);
for (int i = 0; i < n; ++i) cin >> a[i];
for (int r = 0; r < n; r) {
s += a[r];
while (s > t && l <= r) s -= a[l];
m = max(m, r - l + 1);
}
cout << m << endl;
return 0;
}