zoukankan      html  css  js  c++  java
  • 【ECJTU_ACM 11级队员2012年暑假训练赛(7) H Bookshelf 2】

    H - Bookshelf 2
    Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u

    Description

    Farmer John recently bought another bookshelf for the cow library, but the shelf is getting filled up quite quickly, and now the only available space is at the top.

    FJ has N cows (1 ≤ N ≤ 20) each with some height of Hi (1 ≤ Hi ≤ 1,000,000 - these are very tall cows). The bookshelf has a height of B (1 ≤ B ≤ S, where S is the sum of the heights of all cows).

    To reach the top of the bookshelf, one or more of the cows can stand on top of each other in a stack, so that their total height is the sum of each of their individual heights. This total height must be no less than the height of the bookshelf in order for the cows to reach the top.

    Since a taller stack of cows than necessary can be dangerous, your job is to find the set of cows that produces a stack of the smallest height possible such that the stack can reach the bookshelf. Your program should print the minimal 'excess' height between the optimal stack of cows and the bookshelf.

    Input

    * Line 1: Two space-separated integers: N and B
    * Lines 2..N+1: Line i+1 contains a single integer: Hi

    Output

    * Line 1: A single integer representing the (non-negative) difference between the total height of the optimal set of cows and the height of the shelf.

    Sample Input

    5 16
    3
    1
    3
    5
    6

    Sample Output

    1


     1 #include <iostream>
     2 #include <stdio.h>
     3 using namespace std;
     4 
     5 #define INT_MAX 2 << 10
     6 
     7 int iMap[21],n,iBookshelf,iMin,iTmp;
     8 
     9 void iTry(int k)
    10 {
    11     if(k>n)return;
    12     if(iTmp>=iBookshelf&&iTmp-iBookshelf>=iMin)return;
    13 
    14     iTmp+=iMap[k];
    15     if(iTmp>=iBookshelf)
    16     {
    17       if(iTmp-iBookshelf<iMin)
    18         iMin=iTmp-iBookshelf;
    19     }
    20     else
    21     {
    22       iTry(k+1);
    23     }
    24     iTmp-=iMap[k];
    25 
    26     iTry(k+1);
    27 }
    28 
    29 int main()
    30 {
    31     //freopen("in.dat", "r", stdin);
    32     int i;
    33     scanf("%d%d",&n,&iBookshelf);
    34     for(i=1;i<=n;i++)
    35       scanf("%d",&iMap[i]);
    36 
    37     iMin=INT_MAX;
    38     iTmp=0;
    39     iTry(1);
    40     printf("%d\n",iMin);
    41 
    42     return 0;
    43 }
    44 
    45 // end
    46 // ism
  • 相关阅读:
    [转]学习B站动态转发抽奖脚本
    【LeetCode】236. 二叉树的最近公共祖先
    Java中邮件的发送
    最长递增子序列(LIS)
    最长公共子序列(LCS)
    【LeetCode】69. x 的平方根
    Lombok的使用
    Centos 中文乱码解决方法
    FWT,FST入门
    [UOJ310][UNR #2]黎明前的巧克力
  • 原文地址:https://www.cnblogs.com/ismdeep/p/2624407.html
Copyright © 2011-2022 走看看