pat1044 二分法

#include<algorithm>
#include<cstdio>
#include<iostream>
#include<string>
#include<cstring>
#define ll long long
using namespace std;
int a[100005];
int main()
{
	int n,m,i,j,x;
	while(scanf("%d%d",&n,&m)!=EOF)
	{
		int minmax = 1e9;
		for(i = 1;i<=n;i++)
		{
			scanf("%d",&x);
			a[i] = a[i-1]+x;
		}
		for(i = 0;i<=n;i++)
		{
			int *pos = lower_bound(a+i+1,a+n+1,m+a[i]);
			if(pos-a>n)continue;
			minmax = min(minmax,*pos-a[i]);
		}
		for(i = 0;i<=n;i++)
		{
			int *pos = lower_bound(a+i+1,a+n+1,minmax+a[i]);
			if(pos-a>n)continue;
			if(*pos-a[i] == minmax)printf("%d-%d\n",i+1,pos-a);
		}
	}
	return 0;
}