PAT A1044

最新推荐文章于 2022-09-12 20:16:28 发布

xiao1guaishou

最新推荐文章于 2022-09-12 20:16:28 发布

阅读量387

点赞数

CC 4.0 BY-SA版权

分类专栏： PAT 二分法

本文链接：https://blog.youkuaiyun.com/xiao1guaishou/article/details/89054870

PAT 同时被 2 个专栏收录

60 篇文章

订阅专栏

二分法

5 篇文章

订阅专栏

这篇博客介绍了火星购物的独特体验，支付方式使用钻石链。题目要求根据钻石链上的价值和顾客需支付的金额，找出所有可能的支付选项。如果无法精确支付，需要提供最小损失的解决方案。文章提供了输入输出规范，一个样例输入和相应的输出，以及解题思路，包括使用二分查找的方法来找到符合条件的钻石组合。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目：
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 (≤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.
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.将输入的数组A依次求和得到数组sum,这是sum数组递增
2.由于sum[i]表示1~i个元素之和，因此sum[j]-sum[i-1]代表i到j的和，且由于sum[j]-sum[i-1] = M 转化为查找sum[j] = sum[i-1]+M;
3.第一次遍历求出大于等于M的最接近M的nears
4.第二次遍历找出那些值恰好为nears的方案并输出.

代码实现：

#include <cstdio>
#include <algorithm>
using namespace std;
const int Max = 100010;
int  sum[Max] = {0}, total, M;
int upper(int l, int r, int x){
    while(l < r){
        int mid = (l+r)/2;
        if(sum[mid] < x)
            l = mid+1;
        else
            r = mid;
    }
    return l;
}
int main()
{
    int nears = 1000000000;
    scanf("%d%d", &total, &M);
    for(int i = 1; i <= total; i++ ){
        scanf("%d", &sum[i]);
        sum[i] += sum[i-1];
    }
    for(int i = 1; i <= total; i++){
        int j = upper(i, total+1, sum[i-1] + M) ;
        if(sum[j-1] - sum[i-1] == M){
            nears = M;
            break;
        }
        else if(j <= total && sum[j-1] - sum[i-1] < M){
            nears = min(nears, sum[j]- sum[i-1]);
        }
    }
    for(int i = 1; i <= total; i++){
        int j = upper(i, total+1, sum[i-1]+nears);
        if(sum[j] - sum[i-1] == nears){
            printf("%d-%d\n", i, j);
        }
    }
    return 0;
}