• 1044 Shopping in Mars

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

    1. 16 15
    2. 3 2 1 5 4 6 8 7 16 10 15 11 9 12 14 13

    Sample Output 1:

    1. 1-5
    2. 4-6
    3. 7-8
    4. 11-11

    Sample Input 2:

    1. 5 13
    2. 2 4 5 7 9

    Sample Output 2:

    1. 2-4
    2. 4-5

    题目大意

    求一串数字当中，某一段总和sum大于等于price，且sum-price的值最小，如果结果不唯一，按出现位置的顺序输出

    思路

    一次遍历，动规判断

    C/C++ 

    1. #include
    2. using namespace std;
    3. int main()
    4. {
    5.     int N,price,nums[100001];
    6.     cin >> N >> price;
    7.     for(int z=1;z<=N;z++) cin >> nums[z];
    8.     vectorint,int>> result;
    9.     int head=1,sum=0,key=99999;
    10.     for(int z=1;z<=N;z++){
    11.         sum += nums[z];
    12.         if(sum>=price){
    13.             if(key>sum-price) {
    14.                 result.clear();
    15.                 key = sum-price;
    16.             }
    17.             if(key==sum-price) result.emplace_back(head,z);
    18.             sum -= nums[head]+nums[z];
    19.             z--;
    20.             head++;
    21.         }
    22.     }
    23.  
    24.     for(auto x:result) cout << x.first << "-" << x.second << endl;
    25.     return 0;
    26. }

  • 相关阅读:
    【vue设计与实现】挂载和更新 4-卸载操作&区分vnode的类型
    避免项目资源管理陷阱，8Manage帮你支招！
    量化接口代码能不能用？
    性能测试的时间间隔获取方法
    04-java数据结构之栈的学习
    基于C语言设计的植物大战僵尸小游戏
    基于Django框架的Python学生管理系统
    stm32定时器之简单封装
    加速乐源码（golang版本）
    【面试HOT300】滑动窗口篇
  • 原文地址：https://blog.csdn.net/daybreak_alonely/article/details/127808397