[2011山东省第二届ACM大学生程序设计竞赛]——Mathmen

2011年山东省第二届ACM大学生程序设计竞赛中的Mathmen题目,通过贪心策略解决。题目要求找到从第一个城市到最后一个城市耗油最少的路径。先计算城市间距离并排序,然后按交通工具行驶距离降序排列。使用优先队列,以耗油量为优先级,不断消耗交通工具直至到达终点。注意数据类型用Long long存储,大量输入时使用scanf提高效率。

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

Mathmen

Time Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^

题目:http://acm.sdut.edu.cn/sdutoj/problem.php?action=showproblem&problemid=2168

题目描述
Mathmen love mathematics, and they live on the number line. All the mathmen spend all their time on solving mathematical problems and proving theorems. Like humen beings, mathmen don't live in the same country there are n mathmen countries on difierent positions of the number line (country i lives at position xi (one point on the number line), and xi < xi + 1 for all 1 <= i <= n - 1). Mathmen in difierent countries are good at difierent areas of mathematics. For example, mathmen living in country 1 are good at geometry, while mathmen living in country 2 are experts on algebra.
Lately, all the mathmen nations have collaborated on a huge problem, which involves all areas of mathematics, and each mathmen country is responsible for solving the part they are good at. After hours of work (they are really good at mathematics, and no problem would cost them more than one day to solve), they all finish their jobs. Now, they need to collect the result in every mathmen country, and combine them together to create the solution to the huge problem. So they decide to let one mathman collect all the results and send it to one country, where all the work will be merged.
As mathmen are devoted to solving mathematical problems, their legs has become very weak after millions of years of evolution. Therefore, they
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值