Monkey and Banana Problem

The Link to problem.

 

Back to Shang Hai yesterday, nothing to do, continue this acm coding:)

This puzzle is called Monkey and banana problem, which content actually is not so related to its name.

 

say, one monkey in order to get the banana hang on the room's roof, need to make up a tower by pieces

of brick, so input a list of brick info then make a algorithm to out put the max height the tower could be.

 

roughly it's a DP problem, suppose put one brick in any way, then treat the roof of the brick as base, and recurring

to get max height of this first step.  the code following is write by this thinking.

 

and we still can improve the efficiency by cut of some no needed branches,

but how to cut? how to judge it's a branch can not have good result out?

 

* the base should be square with biggest area? NO.

* if one base is so big to be able to hold all other possible square, then this base should be put at bottom? really?

 

I will do this later, hope I really got time to do it :) 

 

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值