cf1197A A. DIY Wooden Ladder

给定若干木板长度,无法切割但可以拼接,求能组成的最大阶梯层数。每层阶梯需要两块至少为层数加一长度的木板作为支撑,其余木板作为台阶。输出能组成的最大阶梯层数,若无法组成一层阶梯则输出0。
摘要由CSDN通过智能技术生成

Let’s denote a k-step ladder as the following structure: exactly k+2 wooden planks, of which

two planks of length at least k+1 — the base of the ladder;
k planks of length at least 1 — the steps of the ladder;
Note that neither the base planks, nor the steps planks are required to be equal.

For example, ladders 1 and 3 are correct 2-step ladders and ladder 2 is a correct 1-step ladder. On the first picture the lengths of planks are [3,3] for the base and [1] for the step. On the second picture lengths are [3,3] for the base and [2] for the step. On the third picture lengths are [3,4] for the base and [2,3] for the steps.

You have n planks. The length of the i-th planks is ai. You don’t have a saw, so you can’t cut the planks you have. Though you have a hammer and nails, so you can assemble the improvised “ladder” from the planks.

The question is: what is the maximum number k such that you can choose some subset of the given planks

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值