Gone Fishing (经典贪心)
来源:互联网 发布:最新家庭网络投资理财 编辑:程序博客网 时间:2024/05/02 13:04
Gone Fishing
Time Limit:1000MS Memory Limit:65536K
Total Submit:59 Accepted:21
Description
John is going on a fishing trip. He has h hours available (1 <= h <= 16), and there are n lakes in the area (2 <= n <= 25) all reachable along a single, one-way road. John starts at lake 1, but he can finish at any lake he wants. He can only travel from one lake to the next one, but he does not have to stop at any lake unless he wishes to. For each i = 1,...,n - 1, the number of 5-minute intervals it takes to travel from lake i to lake i + 1 is denoted ti (0 < ti <=192). For example, t3 = 4 means that it takes 20 minutes to travel from lake 3 to lake 4. To help plan his fishing trip, John has gathered some information about the lakes. For each lake i, the number of fish expected to be caught in the initial 5 minutes, denoted fi( fi >= 0 ), is known. Each 5 minutes of fishing decreases the number of fish expected to be caught in the next 5-minute interval by a constant rate of di (di >= 0). If the number of fish expected to be caught in an interval is less than or equal to di , there will be no more fish left in the lake in the next interval. To simplify the planning, John assumes that no one else will be fishing at the lakes to affect the number of fish he expects to catch.
Write a program to help John plan his fishing trip to maximize the number of fish expected to be caught. The number of minutes spent at each lake must be a multiple of 5.
Input
You will be given a number of cases in the input. Each case starts with a line containing n. This is followed by a line containing h. Next, there is a line of n integers specifying fi (1 <= i <=n), then a line of n integers di (1 <=i <=n), and finally, a line of n - 1 integers ti (1 <=i <=n - 1). Input is terminated by a case in which n = 0.
Output
For each test case, print the number of minutes spent at each lake, separated by commas, for the plan achieving the maximum number of fish expected to be caught (you should print the entire plan on one line even if it exceeds 80 characters). This is followed by a line containing the number of fish expected.
If multiple plans exist, choose the one that spends as long as possible at lake 1, even if no fish are expected to be caught in some intervals. If there is still a tie, choose the one that spends as long as possible at lake 2, and so on. Insert a blank line between cases.
Sample Input
2 1 10 1 2 5 2 4 4 10 15 20 17 0 3 4 3 1 2 3 4 4 10 15 50 30 0 3 4 3 1 2 3 0
Sample Output
45, 5 Number of fish expected: 31 240, 0, 0, 0 Number of fish expected: 480 115, 10, 50, 35 Number of fish expected: 724
- Gone Fishing (经典贪心)
- uva757 - Gone Fishing(贪心)
- Gone Fishing(Poj1042)(贪心+枚举)
- poj 1042 Gone Fishing(贪心 钓鱼)
- NYOJ 30 Gone Fishing(枚举+贪心)
- NYOJ 30Gone Fishing(贪心)
- POJ 1042 Gone Fishing(贪心+枚举)
- UVA 757 Gone Fishing(贪心 + 暴力)
- uva 757 Gone Fishing(贪心)
- POJ 1042 Gone fishing(枚举+贪心)
- NYOJ 30 Gone Fishing(贪心)
- POJ 1042 Gone Fishing (贪心)
- uva 757 Gone Fishing (贪心)
- POJ 1042 Gone Fishing(模拟+贪心)
- LightOJ 1106 Gone Fishing(贪心)
- POJ1042 Gone Fishing(贪心)
- 1042 Gone Fishing //贪心
- POJ1042 Gone Fishing 贪心
- 未来跨媒体管理将主导在线图像服务
- PB的单选按钮
- GridView使用技巧之:如何在RowCommand里获取模板列里绑定的内容?
- 在Windows里搭建Python的GTK+环境搭建注意事项
- windows运行命令详解
- Gone Fishing (经典贪心)
- tomcat5.5.28+admin+serverlet配置数据源连接池
- C语言system函数用法
- java使用JNI调用C++函数
- web服务器并发策略
- XP下高分辨率改桌面大图标方法
- ASP.NET MVC2 学习笔记之URL路由
- bulletedlist 加 sql server 采集网站地址
- 比尔.盖茨 给年轻人的十点忠告