Shopping in Mars (25)

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.

输入描述:
Each input file contains one test case. For each case, the first line contains 2 numbers: N (<=105), the total number of diamonds on the chain, and M (<=108), the amount that the customer has to pay. Then the next line contains N positive numbers D1 … DN (Di<=103 for all i=1, …, N) which are the values of the diamonds. All the numbers in a line are separated by a space.

输出描述:
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.

输入例子:
16 15
3 2 1 5 4 6 8 7 16 10 15 11 9 12 14 13

输出例子:
1-5
4-6
7-8
11-11

---

大意描叙
给出一个整数数组（长度可高达十万）和一个整数m，需要你列出所有符合后面减去前面的刚好等于m的位置组合。

分析
常规方法就是组个数嵌套遍历，时间赋值度高达n^2,超时无疑。于是可以对数据先进行处理，计算出到i下标时第一个值到
当前值的总和保存到sum[i]。然后sum[j]-sum[i]等于input[i]到input[j]之和。接下来我的方法是遍历一次sum[],用map来找
找sum数组中是否存在m-sum[i]，map自然就是保存sum到index的键值对了。但是其实还有一个跟好的方法，复杂度低
至O(n),接下来给出两种方法的代码。。。。

**My First Code **

#include<iostream>
#include<stdio.h>
#include<map>
using namespace std;
const int maxn = 100009;
map<int, int>simap;	//find the index by the sum;
int  input[maxn];	//save the sum form input[0] to input[max]
int main(){
	int n, sum,tsum=0;
	//get input data
	scanf("%d%d", &n, &sum);
	for (int i = 1; i <= n; i++){
		scanf("%d", &input[i]);
		tsum += input[i];
		input[i] = tsum;
		simap[tsum] = i;
	}
	//print the answer
	for (int i = 1; i <= n; i++){
		if (input[i] == sum){	//handle the the case that res = 0
			cout << 1 << "-"<<i << endl;
			continue;
		}
		int last = simap[input[i] - sum];
		if ( last == 0) continue;
		cout << last+1 << "-"<< i << endl;
	}
	return 0;
}

My Second Code
一开始没有想到这种方法，拟定一个左右边界l和r，两个边界都只需要往右走即可。
r不断向右走直至遇到第一个sum[r] - sum[l] 不小于sum 的情况，下一步 l 向前走一步，
注意这时有 sum[r] - sum[l] 必定小于sum,所以想找到下一个 sum[r] - sum[l] = sum 的
情况 r 只需要往又走。 这种方法复杂度仅为O (n)!

#include<iostream>
#include<stdio.h>
using namespace std;
const int maxn = 10009;
int input[maxn];
int main(){
	int n, sum;
	//get input data
	scanf("%d%d", &n, &sum);
	for (int i = 1; i <= n; i++){
		scanf("%d", &input[i]);
		input[i] += input[i - 1];
	}
	int l = 0, r = 0;	
	for (; l <= n; l++){
		while (r<=n && input[r] - input[l] < sum) r++;
		if (input[r] - input[l] == sum) {
			printf("%d-%d\n",l+1,r);
		}
	}
}