登录
首页 » C/C++ » LUZHOUYUE

LUZHOUYUE

于 2020-12-05 发布 文件大小:1KB
0 48
下载积分: 1 下载次数: 1

代码说明:

  今天,小 G 已了解到修理厂共有 m 种不同的修理原料,对于第 i 种原料,可以对任意一个石桥的美化度增加 di,当然这也需要花费 hi 的费用。由于发货场的修理原料有限,对于任意一种修理原料,只有一件,也就是说小 G 只能选择购买和不购买,对于第 i 种修理材料能成功修理第 j 个石桥的条件是:当且仅当 hi ≥ pj,di ≥ vj。现在,已知这 n 个石桥修理的最小花费值,最小美化需求度,以及 m 种修理原料的费用,可对石桥增加的美化度值,请你帮助小 G 完成这个修理任务。(Today, Xiao G has learned that there are m different repair materials in the repair shop. For the first material, Di can be added to the beautification of any stone bridge. Of course, it also costs hi. Because of the limited repair materials in the delivery yard, there is only one repair material for any kind of repair material, that is to say, small G can only choose to buy or not to buy. For the first repair material, the condition for successful repair of the jth stone bridge is: if and only if hi is greater than pj, Di is greater than vj. Now, the minimum cost of repairing n stone bridges, the minimum demand for beautification, and the cost of m kinds of repairing materials are known, which can increase the beautification value of stone bridges. Please help Xiao G to complete this repairing task.)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • 696524资源总数
  • 103930会员总数
  • 47今日下载