1044. Shopping in Mars (25)

最新推荐文章于 2024-02-19 18:18:20 发布

puppet_pyt

最新推荐文章于 2024-02-19 18:18:20 发布

阅读量197

点赞数

分类专栏： pat甲级文章标签： c++ pat

本文链接：https://blog.csdn.net/puppet_pyt/article/details/70596621

版权

pat甲级专栏收录该内容

55 篇文章 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:

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⁵), the total number of diamonds on the chain, and M (<=10⁸), the amount that the customer has to pay. Then the next line contains N positive numbers D₁ ... D_N (D_i<=10³ 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 D_i + ... + D_j = 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 D_i + ... + D_j > M with (D_i + ... + D_j - 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

边输入计算现有长度的总价，如果相等则可以直接输出头尾，如果大于所需价格则从头开始截，截止小于或者等于总价，等于就输出，小于继续循环；

#include <iostream>
#include <vector>
#include <cstdio>
#include <utility>
#define MAX 100005
using namespace std;

int main()
{
    int n, total;
    int value = 0;
    int pre = 1;
    vector<int> a(MAX);
    vector< pair<int, int> > mint;//记录不存在相等时的最小项链
    scanf("%d%d", &n, &total);
    int flag = 1;
    int mintotal = MAX;
    for(int i=1; i<=n; i++)
    {
        scanf("%d", &a[i]);
        value += a[i];
        if(value == total)//价格相等则输出
        {
            printf("%d-%d\n", pre, i);
            flag = 0;
        }
        else if(value > total)//价格较大时
        {
            while(value > total)
            {
               if(flag)//如果不存在相等价格时
                {
                    if(value < mintotal)//如果价格比最小的价格还要小则清空之前记录并记录最小价格
                    {
                        mintotal = value;
                        mint.clear();
                        mint.push_back(make_pair(pre, i));
                    }
                    else if(value == mintotal)
                    {
                        mint.push_back(make_pair(pre, i));
                    }
                }
                value -= a[pre];
                pre++;
            }
            if(value == total)//可能正好减至相等就输出
            {
                printf("%d-%d\n", pre, i);
                flag = 0;
            }
        }
    }
    if(flag)
    {
        for(int i=0; i<mint.size(); i++)
            printf("%d-%d\n", mint[i].first, mint[i].second);
    }
    return 0;

}