程序设计基础52 二分关于连续串的和的表示法

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: 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

一，关注点

1，我的解法在判断二分的时候若是判断出当前和大于M+nearS的时候，必须选择提前退出，否则会超时。

2，标准解法的技巧值得借鉴，就是求连续序列和的时候可以建立一个sum数组，存储从开始到当前位置所有数值的和。

二，我的代码

#include<cstdio>
using namespace std;
const int INF = 1000000000;
const int max_n = 100100;
int M = 0, nearS = INF;
int arr[max_n];
struct Node {
	int x, y;
}node[max_n];
int real_sum_of_arr(int num[], int start, int end) {
	int sum = 0;
	for (int i = start; i <= end; i++) {
		sum += num[i];
/*		if (sum > M + nearS) {
			return -1;
		}*/
	}
	return sum;
}
int sum_of_arr(int num[],int start, int end) {
	int sum = 0;
	for (int i = start; i <= end; i++) {
		sum += num[i];
		if (sum > M + nearS) {
			return -1;
		}
	}
	return sum;
}
int binary_search(int num[], int start, int right, int x) {
	int mid;
	int left = start;
	while (left < right) {
		mid = (left + right) / 2;
		if (sum_of_arr(num,start,mid) >= x||sum_of_arr(num,start,mid) == -1) {
			right = mid;
		}
		else {
			left = mid + 1;
		}
	}
	return left;
}
int main() {
	int N = 0;
	int num = 0, protein_nearS = 0;
	int forsee_pos = 0;
	scanf("%d %d", &N, &M);
	for (int i = 0; i < N; i++) {
		scanf("%d", &arr[i]);
	}
	for (int pos = 0; pos < N; pos++) {
		forsee_pos = binary_search(arr, pos, N, M);
		if (forsee_pos == N)break;
		else {
			protein_nearS = real_sum_of_arr(arr, pos, forsee_pos) - M;
			if (protein_nearS == nearS) {
				node[num].x = pos + 1;
				node[num].y = forsee_pos + 1;
				num++;
			}
			else if (protein_nearS < nearS) {
				num = 0;
				nearS = protein_nearS;
				node[num].x = pos + 1;
				node[num].y = forsee_pos + 1;
				num++;
			}
		}
	}
	for (int i = 0; i < num; i++) {
		printf("%d-%d\n", node[i].x, node[i].y);
	}
	return 0;
}