题目

#include<bits/stdc++.h>
using namespace std;
long long h[100005];
int main()
{
	long long n,m,high=0,highl,highr;
	cin>>n>>m;
	for(int i=1;i<=n;i++)
	{
		cin>>h[i];
		h[i]+=h[i-1];
	}
	for(int l=1;l<=n;l++)
		for(int r=l;r<=n;r++)
		{
			int sum=h[r]-h[l-1];
			if(sum<m&&sum>high)
			{
				high=sum;	
				highl=l;
				highr=r;		
			}
		}
	cout<<highl<<" "<<highr<<" "<<high;
	return 0;
}