PAT-A1044题解

最新推荐文章于 2020-05-18 14:18:52 发布

悟空在游泳

最新推荐文章于 2020-05-18 14:18:52 发布

阅读量539

点赞数

分类专栏：算法入门数据结构 PAT题解目录文章标签： PAT 算法数据结构

本文链接：https://blog.csdn.net/geek_jerome/article/details/86769637

版权

这篇博客介绍了PAT-A1044编程题的解决方案，涉及火星上的一种特殊支付方式——钻石链支付。题目要求根据钻石链的价值和顾客需支付的金额，找出所有可能的支付选项，或者给出最接近的超额支付方案。博主分享了如何利用预处理和二分查找优化算法，以避免超时，降低时间复杂度至O(n log n)。

摘要由CSDN通过智能技术生成

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:

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

题目大意：给你n个数字，然后给定一个数值m，找出数字片段之和等于m的索引区间。
如果没有的话，就找出大于m的最接近的值的