PAT A1044 shopping in mars (25)

没超时所以没用二分法

#include<cstdio>

#include<algorithm>
using namespace std;
int main(){
int n,m,tag=0;
scanf("%d%d",&n,&m);
int i;
int diam[100010];
for(i=0;i<n;i++){
scanf("%d",&diam[i]);
}
int pay=0,minpay=1001;// whether over int?
int j=0;
i=0;
int mini;
while(j<=n && i<n){
//int mid=(i+j)/2;
//j=i;
//pay=0;
while(pay<m && j<n){
pay+=diam[j];
j++;
}
if(pay==m) {
printf("%d-%d\n",i+1,j);
tag=1;
}else if(pay>m){
if(minpay>pay){
minpay=pay;
mini=i;
}
}
pay -= diam[i];
i++;
//j=i;
}
if(tag==1) return 0;
else{
i=mini;
j=mini;
pay=0;
while(j<=n && i<n){
//int mid=(i+j)/2;
while(pay<m && j<n){
pay+=diam[j];
j++;
}
if(pay==minpay) {
printf("%d-%d\n",i+1,j);

}
pay -= diam[i];
i++;
//j=i;
}
}
system("pause");
return 0;
}