zoukankan      html  css  js  c++  java
  • POJ Bookshelf 2(DFS)

    Bookshelf 2
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 5109   Accepted: 2350

    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 ≤ BS, 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

    Source

    //这题和上次ZOJ月赛的一题差不多,我都是用收索过的
    //因为N比较小
    #include <iostream> #include <stdio.h> #include <string.h> #include <algorithm> #include <queue> #include <cmath> using namespace std; int a[22]; int N,B,Min; bool cmp(const int&a,const int &b) { return a>b; } void dfs(int k,int sum) {
    if(Min==0) return;//加了这句就0Ms,不然就16Ms
    if(sum>=B) { Min=min(Min,sum-B); return ; } int i,s=0; for(i=k;i<N;i++) s+=a[i]; if(sum+s<B) return; dfs(k+1,sum+a[k]); dfs(k+1,sum); } int main() { int i; while(scanf("%d%d",&N,&B)!=EOF) { Min=B; for(i=0;i<N;i++) scanf("%d",&a[i]); sort(a,a+N,cmp); dfs(0,0); printf("%d\n",Min); } return 0; }
  • 相关阅读:
    分布式中各种概念汇总
    JMS
    spring boot jpa mysql
    spring boot 视图层(JAVA之学习-2)
    idea+spring boot的初学(JAVA学习之1)
    Yii在cli模式下执行一些脚本的配置
    在centos下安装django
    python简单的发送邮件
    ElasticSearch-PHP的API使用(二)
    Elasticsearch的PHP的API使用(一)
  • 原文地址:https://www.cnblogs.com/372465774y/p/2624536.html
Copyright © 2011-2022 走看看