【NOI OJ】 4.6 贪心 702 Crossing River(过河)

这篇博客探讨了如何使用贪心策略解决NOI在线评测系统中的一道题目——702 Crossing River。文章详细解析了过河问题的贪心算法实现,通过优化步骤来达到高效解题的目标。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

描述

A group of N people wishes to go across a river with only one boat, which can at most carry two persons. Therefore some sort of shuttle arrangement must be arranged in order to row the boat back and forth so that all people may cross. Each person has a different rowing speed; the speed of a couple is determined by the speed of the slower one. Your job is to determine a strategy that minimizes the time for these people to get across.
输入
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值