这是一道关于奶牛和摩天大楼的动态规划问题。给定每头奶牛的重量和电梯的最大载重，求解如何用最少的电梯行程将所有奶牛送回地面。通过状态压缩动态规划方法解决，限制条件是奶牛数量不超过18，电梯最大载重量不超过100,000,000磅。"
126097318,11412145,前端面试必备：61道常见题目详解,"['前端开发', 'JavaScript', '面试准备']
【原题】
A little known fact about Bessie and friends is that they love stair climbing races. A better known fact is that cows really don’t like going down stairs. So after the cows finish racing to the top of their favorite skyscraper, they had a problem. Refusing to climb back down using the stairs, the cows are forced to use the elevator in order to get back to the ground floor.
The elevator has a maximum weight capacity of W (1 <= W <= 100,000,000) pounds and cow i weighs C_i (1 <= C_i <= W) pounds. Please help Bessie figure out how to get all the N (1 <= N <= 18) of the cows to the ground floor using the least number of elevator rides. The sum of the weights of the cows on each elevator ride must be no larger than W.
【题目翻译】
有n头奶牛 ( 1 ≤ n ≤ 18 ) (1≤n≤18) (1≤n≤18)，每一栋摩天大楼容量为W ( 1 ≤ W ≤ 1 0 8 ) , (1≤W≤10^8), (1≤W≤108),，每头奶牛有一个质量c[i] ( 1 ≤ c [ i ] ≤ W ) (1≤c[i]≤W) (1≤c[i]≤W)，问将所有的奶牛安置需要几栋摩天大楼。
【输入格式】
第一行，两个数n,W
接下来n行，每行一个数c[i]
【输出格式】
一个数，安置所有的奶牛最少需要几栋摩天大楼。
S a m p l e    I n p u t Sample\;Input SampleInput
4 10
5
6
3
7
S a m p l e    O u t p u t Sample\;Output SampleOutput
3
【题意分析】
经典的状压DP题。 n ≤ 18 n≤18 n≤18可以卡掉大部分爆搜（超神搜索请无视）
d p [ i ] dp[i] dp[i]表示状态为 i i i时最少需要几栋摩天大楼。
r e s t [ i ] rest[i]
最低0.47元/天 解锁文章
扫一扫
174
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
