题解 | dd爱框框

#include<bits/stdc++.h>
using namespace std;
using ll=long long;
const ll N=1e7+5;
ll pre[N];
ll id,n,x;

bool check(ll m){
    if(pre[id]-pre[m-1]>=x)return true;
    else return false;
}

int main(){
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    cin>>n>>x;
    for(ll i=1;i<=n;i++){
        ll t;
        cin>>t;
        pre[i]=pre[i-1]+t;
    }
    ll cmp=1e18;
    pair<ll,ll>ans;
    for(id=1;id<=n;id++){
        ll l=0,r=id+1;
        while(l+1<r){
            ll mid=l+(r-l)/2;
            if(check(mid))l=mid;
            else r=mid;
        }
        if(l==0)continue;
        else {
            if(id-l+1<cmp){
                ans={l,id};
                cmp=id-l+1;
            }
            //cout<<l<<' '<<id<<'\n';
        }
    }
    cout<<ans.first<<' '<<ans.second;

    return 0;
}