鏈接：https://ac.nowcoder.com/acm/contest/993/C
來源：牛客網

題目描述

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.

輸入描述:

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

輸出描述:

* 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. 示例1

輸入

復制 5 16 3 1 3 5 6

輸出

復制 1

說明

Here we use cows 1, 3, 4, and 5, for a total height of 3 + 3 + 5 + 6 = 17.
It is not possible to obtain a total height of 16, so the answer is 1.

題意：給定n個數，問：任意i個數的和sum（i<=n）與 h的差最小為多少？（要求sum>=h）

題解：DFS

#include<iostream> #include<algorithm> #include<vector> #define ll long long using namespace std; int a[20]; int n,h,x=99999999; void dfs(int id,int sum) {if(id>=n){if(sum>=h)x=min(x,sum-h);return;}else if(x==0)return;else{dfs(id+1,sum);dfs(id+1,sum+a[id]);} } int main() {scanf("%d%d",&n,&h);for(int i=0;i<n;i++)scanf("%d",&a[i]);//sort(a,a+n);dfs(0,0);printf("%d\n",x);return 0; }

?

轉載于:https://www.cnblogs.com/-citywall123/p/11197032.html

創作挑戰賽新人創作獎勵來咯，堅持創作打卡瓜分現金大獎

總結

以上是生活随笔為你收集整理的Bookshelf 2 简单DFS的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。