PAT A 甲级 1044 Shopping in Mars (25分)

1044 Shopping in Mars (25分)

吐槽

怎么又是火星人？你们比小明还事多。

思路

逻辑蛮简单的，成块找可行的组合就行。用遍历的话，一个循环遍历头，里面套一个循环遍历尾，判断这个头尾能不能行，复杂度O(n²)。
然而超时。

不过解决方法也还算简单。先找到以1为头的第一个可行组合，然后移到2为头时判断去掉1是否还够大，够则成为新方法，不够则把尾往后移到够大，然后判断和已有的最小支付额比的大小关系决定怎么保留，这样重复直到尾移到最后一个还不够大时中断循环。也就是头尾一起移动啦。复杂度就降下来了。

代码

#include<iostream>
#include<vector>

#define INF 0xcffffff

using namespace std;

int main()
{
	int i, ii, n, m, temp;
	cin >> n >> m;
	vector<int> chain;
	vector<pair<int, int>> ways;
	for (i = 0; i < n; i++)
	{
		cin >> temp;
		chain.push_back(temp);
	}
	int min = INF;
	int sum = 0;
	int right;
	for (i = 0; i < n; i++)
	{
		sum += chain[i];
		if (sum >= m)
		{
			ways.push_back(make_pair(0, i));
			min = sum;
			right = i;
			break;
		}
	}
	for (i = 1; i < n; i++)
	{
		sum -= chain[i - 1];
		if (sum >= m && sum <= min)
		{
			if (sum < min)
				ways.clear();
			ways.push_back(make_pair(i, right));
			min = sum;
			continue;
		}
		else
		{
			while (sum < m && right < n)
			{
				right++;
				if (right != n)
					sum += chain[right];
			}

			if (right == n)
				break;
			else
			{
				if (sum <= min)
				{
					if (sum < min)
						ways.clear();
					ways.push_back(make_pair(i, right));
					min = sum;
				}
			}
		}
	}

	for (i = 0; i < ways.size(); i++)
	{
		cout << ways[i].first + 1 << "-" << ways[i].second + 1 << endl;
	}
	return 0;
}

题目

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