1.链接地址:

http://bailian.openjudge.cn/practice/1042/

http://poj.org/problem?id=1042

2.题目:

Gone Fishing
Time Limit: 2000MS   Memory Limit: 32768K
Total Submissions: 27652   Accepted: 8199

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

Source

3.思路:

DP

4.代码:

 //2010-04-22
//v0.1 create by wuzhihui
#include<iostream>
using namespace std; int ti[];//ti (0 < ti <=192
int fi[];
int fi2[];
int di[];
int a[];
int maxa[];
int main()
{
int i,j;
int h,h2;//hour between 1<=h<=16
int n;//lake 2 <= n <= 25
int fishes;
int maxfishes,temp;
int max;
while((cin>>n)&&n!=)
{
cin>>h;
for(i=;i<n;i++) cin>>fi[i];
for(i=;i<n;i++) cin>>di[i];
for(i=;i<n-;i++) cin>>ti[i];
max=-;
for(j=;j<n;j++) a[j]=;
for(i=;i<n;i++)
{
h2=h*;
//memset(a,0,sizeof(a));
for(j=;j<n;j++) a[j]=;
fishes=;
for(j=;j<n;j++) fi2[j]=fi[j];
for(j=;j<=i-;j++) h2-=ti[j];
while(h2>)
{
maxfishes=-;
for(j=;j<=i;j++)
{
if(fi2[j]>maxfishes)
{
maxfishes=fi2[j];
temp=j;
}//if
}//for_j
fishes+=maxfishes;
a[temp]++;
if(fi2[temp]<di[temp]) fi2[temp]=;
else fi2[temp]-=di[temp];
h2--;
}//while_h2
if(max<fishes)
{
max=fishes;
for(j=;j<n;j++) maxa[j]=a[j];
}//if
}//while_n
cout<<(maxa[]*);
for(i=;i<n;i++) cout<<", "<<(maxa[i]*);
cout<<endl;
cout<<"Number of fish expected: "<<max<<endl<<endl;
} return ;
}

Poj/OpenJudge 1042 Gone Fishing的更多相关文章

  1. POJ #1042 Gone Fishing - WA by a DP solution. TODO

    I used DP instead of Greedy. But got WA on PoJ, though it passed all web-searched cases. Maybe I hav ...

  2. POJ 1042 Gone Fishing (贪心)(刘汝佳黑书)

    Gone Fishing Time Limit: 2000MS   Memory Limit: 32768K Total Submissions: 30281   Accepted: 9124 Des ...

  3. poj -- 1042 Gone Fishing(枚举+贪心)

    题意: John现有h个小时的空闲时间,他打算去钓鱼.钓鱼的地方共有n个湖,所有的湖沿着一条单向路顺序排列(John每在一个湖钓完鱼后,他只能走到下一个湖继续钓),John必须从1号湖开始钓起,但是他 ...

  4. POJ 1042 Gone Fishing

    题意:一个人要在n个湖中钓鱼,湖之间的路径是单向的,只能走1->2->3->...->n这一条线路,告诉你每个湖中一开始能钓到鱼的初始值,和每钓5分钟就减少的数量,以及湖之间的 ...

  5. POJ 1042 Gone Fishing#贪心

    (- ̄▽ ̄)-* #include<iostream> #include<cstdio> #include<cstring> using namespace std ...

  6. POJ 1042 Gone Fishing( DP )

    题意:小明打算做一个h((1 <= h <= 16))个小时钓鱼旅行.发现这里有n(2 <= n <= 25)个湖,而且所有的湖都在一条路的旁边.小明打算从第1个湖开始钓起,每 ...

  7. Poj OpenJudge 百练 1062 昂贵的聘礼

    1.Link: http://poj.org/problem?id=1062 http://bailian.openjudge.cn/practice/1062/ 2.Content: 昂贵的聘礼 T ...

  8. Poj OpenJudge 百练 1860 Currency Exchang

    1.Link: http://poj.org/problem?id=1860 http://bailian.openjudge.cn/practice/1860 2.Content: Currency ...

  9. Poj OpenJudge 百练 2602 Superlong sums

    1.Link: http://poj.org/problem?id=2602 http://bailian.openjudge.cn/practice/2602/ 2.Content: Superlo ...

随机推荐

  1. JavaScript要点(九)HTML DOM

    通过 HTML DOM,可访问 JavaScript HTML 文档的所有元素. HTML DOM (文档对象模型) 当网页被加载时,浏览器会创建页面的文档对象模型(Document Object M ...

  2. CentOS下系统时间同步和时区的修改和设置(用的这个)

    一.修正时区 rm -rf /etc/localtime #删除当前默认时区www.kwx.gd ln -s /usr/share/zoneinfo/Asia/Shanghai /etc/localt ...

  3. C# Winform 支持Hex与ASCII输入和切换的文本框

    最近一直在做一个支持串口,TCP,UDP通讯调试的一体化工具(也就是C#串口调试工具 v2.0的第三版),其中涉及到16进制数据和ASCII码的输入,所以继承了TextBox的基础上,写了这个支持He ...

  4. RotatingDoughnut

      RotatingDoughnut.zip

  5. sphinx的简单实例

    sphinx.conf中的配置: source indexLocation { type = mysql sql_host = 192.168.1.113 sql_user = root sql_pa ...

  6. java跨平台性分析

    实不相瞒,Java是我见过的执行效率最低的程序设计语言,前不久在CSDN论坛上有个评测,计算9999的阶乘,同样的循环算法,Java的耗时是.NET的5倍.我以前很喜欢Serv-U,自从它用Java重 ...

  7. ADT在线安装

    以往安装ADT根本就不是个问题,可是现在就是个大问题了,联通的宽带网络连www.google.com.hk都打不开,你叫我们这些P民怎么活? https://dl-ssl.google.com/and ...

  8. Servlet, Listener 、 Filter.

    Java Web的三大组件:Servlet, Listener . Filter. 使用Listener监听器:八大监听器: 第一组:用于监听Servlet三个域对象的创建与销毁 1. Servlet ...

  9. PHP读书笔记(2)-变量与数据结构

    php中的数据类型: 一.8种主要数据类型 标量类型 1.整型(int|integer):八进制.十进制.十六进制.超过整型存储范围,会产生溢出. 整型数的字长和平台有关,尽管通常最大值是大约二十亿( ...

  10. opencv中的基本拼接

    普通版的图像拼接,事实上非常简单并且效果不很差. 实现方式: 新建工程: 去opencv里面[f:\opencv249\opencv\sources\samples\cpp]把stitching.cp ...