绿色通道

#include<bits/stdc++.h>
using namespace std;
const int N = 5e4 + 7;
int a[N], dp[N], q[N], n, t;
bool check(int m) {
    memset(dp, 0, sizeof(dp));
    int l = 0, r = 0;
    for (int i = 1; i <= n; i++) {
        dp[i] = dp[q[l]] + a[i];
        while (l <= r && i - q[l] > m) l++;
        while (l <= r && dp[q[r]] >= dp[i]) r--;
        q[++r] = i;
    }
    for (int i = n - m + 1; i <= n; i++) {
        if (dp[i] <= t) return true;
    }
    return false;
}
int main() {
    cin >> n >> t;
    for (int i = 1; i <= n; i++) cin >> a[i];
    int l = 0, r = n, ans;
    while (l <= r) {
        int m = (l + r) >> 1;
        if (check(m))
            r = m - 1, ans = m;
        else
            l = m + 1;
    }
    cout << ans << endl;
    return 0;
}