zoukankan      html  css  js  c++  java
  • A1044. 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:

    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:

    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 // hahaha.cpp : 定义控制台应用程序的入口点。
     2 //
     3 
     4 #include <stdafx.h>
     5 #include <stdio.h>
     6 #include <iostream>
     7 #include <vector>
     8 #include <queue>
     9 #include <map>
    10 #include <string>
    11 #include <cstdio>
    12 #include <set>
    13 #include <algorithm>
    14 #include <string.h>
    15 
    16 using namespace std;
    17 const int N=100010;
    18 int sum[N];
    19 int n,s,nears=100000010;
    20 
    21 
    22 
    23 int main() {
    24     scanf("%d %d",&n,&s);
    25     sum[0]=0;
    26     for(int i=1;i<=n;i++)
    27         {
    28         scanf("%d",&sum[i]);
    29         sum[i]+=sum[i-1];
    30         }
    31     for(int i=1;i<=n;i++)
    32         {
    33         int* jj=upper_bound(sum+i,sum+n+1,sum[i-1]+s);
    34         int j=jj-sum;
    35         if(sum[j-1]-sum[i-1]==s)
    36             {
    37             nears=s;
    38             break;
    39             }
    40         else if(j<=n&&sum[j]-sum[i-1]<nears)
    41             {
    42             nears=sum[j]-sum[i-1];
    43             }
    44         }
    45     for(int i=1;i<=n;i++)
    46         {
    47         int* jj=upper_bound(sum+i,sum+n+1,sum[i-1]+nears);
    48         int j=jj-sum;
    49         if(sum[j-1]-sum[i-1]==nears)
    50             {
    51             printf("%d-%d
    ",i,j-1);
    52             }
    53         }
    54      return 0;
    55 }
  • 相关阅读:
    容斥原理算法总结(bzoj 2986 2839)
    网络流系列算法总结(bzoj 3438 1061)
    bzoj 2746: [HEOI2012]旅行问题 AC自动机fail树
    bzoj 3283: 运算器 扩展Baby Step Giant Step && 快速阶乘
    计算几何考场绘图技巧
    bzoj 1845: [Cqoi2005] 三角形面积并 扫描线
    bzoj 3784: 树上的路径 堆维护第k大
    BZOJ 1231: [Usaco2008 Nov]mixup2 混乱的奶牛
    BZOJ 1112: [POI2008]砖块Klo
    BZOJ 1003: [ZJOI2006]物流运输trans DP+最短路
  • 原文地址:https://www.cnblogs.com/ligen/p/4351417.html
Copyright © 2011-2022 走看看