1044 Shopping in Mars (25 分)

Shopping in Mars is quite a different experience. The Mars people pay by chained diamonds. Each diamond has a value (in Mars dollars M$). When making the payment, the chain can be cut at any position for only once and some of the diamonds are taken off the chain one by one. Once a diamond is off the chain, it cannot be taken back. For example, if we have a chain of 8 diamonds with values M$3, 2, 1, 5, 4, 6, 8, 7, and we must pay M$15. We may have 3 options:

Cut the chain between 4 and 6, and take off the diamonds from the position 1 to 5 (with values 3+2+1+5+4=15).
Cut before 5 or after 6, and take off the diamonds from the position 4 to 6 (with values 5+4+6=15).
Cut before 8, and take off the diamonds from the position 7 to 8 (with values 8+7=15).
Now given the chain of diamond values and the amount that a customer has to pay, you are supposed to list all the paying options for the customer.

If it is impossible to pay the exact amount, you must suggest solutions with minimum lost.

Input Specification:
Each input file contains one test case. For each case, the first line contains 2 numbers: N (≤10​5​​ ), the total number of diamonds on the chain, and M (≤10​8​​ ), the amount that the customer has to pay. Then the next line contains N positive numbers D​1​​ ⋯D​N​​ (D​i​​ ≤10
​3​​ for all i=1,⋯,N) which are the values of the diamonds. All the
numbers in a line are separated by a space.

Output Specification:
For each test case, print i-j in a line for each pair of i ≤ j such that Di + … + Dj = M. Note that if there are more than one solution, all the solutions must be printed in increasing order of i.

If there is no solution, output i-j for pairs of i ≤ j such that Di + … + Dj >M with (Di + … + Dj −M) minimized. Again all the solutions must be printed in increasing order of i.

It is guaranteed that the total value of diamonds is sufficient to pay the given amount.

Sample Input 1:
16 15
3 2 1 5 4 6 8 7 16 10 15 11 9 12 14 13
Sample Output 1:
1-5
4-6
7-8
11-11
Sample Input 2:
5 13
2 4 5 7 9
Sample Output 2:
2-4
4-5

ower_bound( )和upper_bound( )都是利用二分查找的方法在一个排好序的数组中进行查找的。

在从小到大的排序数组中，

lower_bound( begin,end,num)：从数组的begin位置到end-1位置二分查找第一个大于或等于num的数字，找到返回该数字的地址，不存在则返回end。通过返回的地址减去起始地址begin,得到找到数字在数组中的下标。

upper_bound( begin,end,num)：从数组的begin位置到end-1位置二分查找第一个大于num的数字，找到返回该数字的地址，不存在则返回end。通过返回的地址减去起始地址begin,得到找到数字在数组中的下标。

在从大到小的排序数组中，重载lower_bound()和upper_bound()

lower_bound( begin,end,num,greater() ):从数组的begin位置到end-1位置二分查找第一个小于或等于num的数字，找到返回该数字的地址，不存在则返回end。通过返回的地址减去起始地址begin,得到找到数字在数组中的下标。

upper_bound( begin,end,num,greater() ):从数组的begin位置到end-1位置二分查找第一个小于num的数字，找到返回该数字的地址，不存在则返回end。通过返回的地址减去起始地址begin,得到找到数字在数组中的下标。

// 前缀和的应用
// 注意二分搜索非常快 
// 二分搜索中 upper_bound()返回第一个大于等于 
#include <iostream>`在这里插入代码片`
#include <cstring>
#include <algorithm>
#include <vector>
#define INF 0x3f3f3f3f
using namespace std;
typedef long long ll;
ll n,m;
struct node{
	int left;
	int right;
};
vector<node> res;
ll S[100004];

int main()
{
	memset(S,0,sizeof(S));
	ll x;
	cin>>n>>m;
	for(int i = 1;i<=n;i++)
	{
		cin>>x;
		S[i]=S[i-1]+x;	
	}
	//因为全为整数只要出现A[j]-A[i]>=m则退出即可
	ll min_num = INF;
	for(int i = 1;i<=n;i++)
	{
		int pos = lower_bound(S+i,S+n+1,S[i-1]+m)-(S+i);
		if(S[pos+i]-S[i-1]>=m&&S[pos+i]-S[i-1]<min_num)
		{
			res.clear();
			min_num = S[pos+i]-S[i-1];
			node t;
			t.left =i;t.right=pos+i;
			res.push_back(t);
		}
		else if(S[pos+i]-S[i-1]==min_num)
		{
			node t;
			t.left =i;t.right=pos+i;
			res.push_back(t);
		}
	}
	for(int i = 0;i<res.size();i++)
	{
		printf("%d-%d\n",res[i].left,res[i].right);
	}
	 return 0;	
}