#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int n,m;
cin>>n>>m;
int diamond[n+1];;
diamond[0]=0;
for(int i=1;i<=n;i++){
scanf("%d",&diamond[i]);
diamond[i]+=diamond[i-1];
}
int minvalue=(1<<31)-1;
for(int i=1;i<=n;i++){
int mid=lower_bound(diamond+i,diamond+n,diamond[i-1]+m)-diamond;
int ans=diamond[mid]-diamond[i-1];
if(ans>=m&&ans<minvalue) minvalue=ans;
}
for(int i=1;i<=n;i++){
int mid=lower_bound(diamond+i,diamond+n,diamond[i-1]+minvalue)-diamond;
int ans=diamond[mid]-diamond[i-1];
if(ans==minvalue){
printf("%d-%d\n",i,mid);
}
}
return 0;
}
PAT A 1044 Shopping in Mars
最新推荐文章于 2022-09-23 16:02:06 发布