原题链接
https://pintia.cn/problem-sets/994805342720868352/problems/994805439202443264
晴神算法笔记题解
(第一次ac)
#include <iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int N =100010;
int n,s,nears=100000010;
int sum[N];
int upper_bound(int left,int right,int s){
int l=left,r=right,mid;
while(l<r){
mid=(l+r)/2;
if(sum[mid]>s){
r=mid;
}
else l=mid+1;;
}
return l;
}
int main()
{
int n,s;
scanf("%d%d",&n,&s);
sum[0]=0;
for(int i=1;i<=n;i++){
scanf("%d",&sum[i]);
sum[i]+=sum[i-1];
}
for(int i=1;i<=n;i++){
int j= upper_bound(i,n+1,sum[i-1]+s);//左边界
if(sum[j-1]-sum[i-1]==s){
nears=s;
break;
}
else if(j<=n&&sum[j]-sum[i-1]<nears){
nears=sum[j]-sum[i-1];
}
}
for(int i=1;i<=n;i++){
int j=upper_bound(i,n+1,sum[i-1]+nears);
if(sum[j-1]-sum[i-1]==nears)
printf("%d-%d\n",i,j-1);
}
return 0;
}