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 (inMars dollars M$). When making the payment, the chain can be cut at any position for only once and some of the diamondsare taken off the chain one by one. Once a diamond is off the chain, it cannot be taken back. For example, if we have achain 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 payingoptions 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⁵), the total number of diamonds on the chain, and M (<=10⁸), the amount that the customer has to pay. Then the next line contains N positive numbers D₁ ... D_N (D_i<=10³ 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 D_i + ... + D_j = 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 D_i + ... + D_j > M with (D_i + ... + D_j - 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

---

提交代码

————————————

主要是二分。。。。。

比如说i到j的数值和，不需要计算，直接1-j的数之和，减去1-i的数值和即可，，，

有好多细节，没有调通，，，，，

去学习了下孙师兄的程序。。。

#include <iostream>
#include <vector>

using namespace std;
/* run this program using the console pauser or add your own getch, system("pause") or input loop */

int N,M;

void findbest(vector<int>& sum, int m, int i, int &j,int &tmpsum){
	int l=i,r=sum.size()-1;
	while(l<r){
		int mid=(l+r)/2;
		if(sum[mid]-sum[i-1]>=m){
			r=mid;
		}else{
			l=mid+1;
		}
	}
	j=r;
	tmpsum=sum[j]-sum[i-1];
}
int main(int argc, char** argv) {
	vector<int> v;
	vector<int> sum;
	int i=0;
	
	scanf("%d %d",&N,&M);
	v.assign(N+1,0);
	sum.assign(N+1,0);
	for(i=1; i<=N; i++){
		scanf("%d",&v[i]);
		sum[i]=sum[i-1]+v[i];
	}
//	for(i=1; i<=N; i++) cout<<sum[i];
	vector<pair<int,int> >so;
	int best=-1;
	for(i=1; i<=N; i++){

		int j,tmpsum;
		findbest(sum,M,i,j,tmpsum);
		if(best==-1 || (tmpsum<best && tmpsum>=M)){
			best=tmpsum;
			so.clear();
			so.push_back(make_pair(i,j));
		}else if(best!=-1 && tmpsum==best){
			so.push_back(make_pair(i,j));
		}
	}
	for(i=0; i<so.size(); i++){
		printf("%d-%d\n",so[i].first,so[i].second);
	}

	return 0;
}