题解 | dd爱框框

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

typedef long long ll;

const int N = 10000000+10;
ll pre[N]; 

int main(){
	int n,x;  cin >> n >> x;
	
	for(int i=1 ; i <= n ; i++){
		int a;  cin >> a;
		pre[i] = pre[i-1] + a;
	}
	
	int now_len = 0,len = 1000000000;
	int ansl=0,ansr=0;
	
	for(int l=1,r=1 ; r<=n ; ){
		if(pre[r] - pre[l-1] < x){
			r++;
		}
		else{
			now_len = r-l+1;
			if(now_len < len || (now_len == len) && l < ansl){
				len = now_len;
				ansl = l;
				ansr = r;
			}
			l++;
		}
	}
	
	cout << ansl << " " << ansr;
	
	return 0;
}