4.5 PAT A1044 Shopping in Mars (25分)(二分；动态规划）

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:

1. 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).
2. Cut before 5 or after 6, and take off the diamonds from the position 4 to 6 (with values 5+4+6=15).
3. 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: NNN (≤105\le 10^5≤10​5​​), the total number of diamonds on the chain, and MMM (≤108\le 10^8≤10​8​​), the amount that the customer has to pay. Then the next line contains NNN positive numbers D1⋯DND_1 \cdots D_ND​1​​⋯D​N​​ (Di≤103D_i\le 10^3D​i​​≤10​3​​ for all i=1,⋯,Ni=1, \cdots , Ni=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 ≤\le≤ j such that DDDi + ... + DDDj = MMM. 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 ≤\le≤ j such that DDDi + ... + DDDj >M> M>M with (DDDi + ... + DDDj −M- M−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

题意为求在给定序列数中是否有某一子序列加起来和刚好等于给定值的子序列 ，若没有则输出大于给定值的最小的和值的子序列的开始及站点位置。

参考代码：

#include <cstdio>
int sum[100020]; //记录从1-i处的和值
int nears=100000010; //记录比给定m大的最小的数 
int upper_bound(int l,int r,int x)
{
	int left=l,right=r;
	while(left<right)
	{
		int mid=(left+right)/2;
		if(sum[mid]>x)
			right=mid;
		else
			left=mid+1;
	}
	return left;
}
int main()
{
	int n,m;
	while(scanf("%d%d",&n,&m)!=EOF)
	{
		sum[0]=0;
		for(int i=1;i<=n;++i)
		{
			scanf("%d",&sum[i]);
			sum[i]+=sum[i-1]; //计算sum[i] 
		}
		for(int i=1;i<=n;++i) //枚举左端点 
		{
			int j=upper_bound(i,n+1,sum[i-1]+m); //求右端点 
			if(sum[j-1]-sum[i-1]==m) //查找成功
			{
				nears=m;
				break;
			} 
			else if(j<=n&&sum[j]-sum[i-1]<nears) //存在大于m的解并小于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; 
 }