POJ 1042

Gone Fishing

Time Limit: 2000MS		Memory Limit: 32768K
Total Submissions: 18901		Accepted: 5322

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

East Central North America 1999

 

---

黑书上面的例题，那书上写的好简单的呃

 

想了挺久

 

应该是枚举 钓鱼的湖的个数，所以总的时间 减去走N个湖的时间就是用来钓鱼的时间，然后在这N个湖里面贪心选择能钓最多鱼的湖，（大概就是书上说的瞬移的意思），因为每个湖钓鱼的个数与总的钓鱼次数无关无关，只与各个湖钓鱼的次数有关。

 

做的时候 没认真看题目 一直搞不懂 剩下来的时间加到哪个湖上面， 后来看题目才发现 有一句没看。 要认真审题啊！！！

 

#include"stdio.h" #include"string.h" #include"stdlib.h" int main(){ int n,h,f[26],d[26],t[26],fs[26]; int i,j,k,time; int ans[26][26]; scanf("%d",&n); while(n != 0){ memset(ans,0,sizeof(ans)); scanf("%d",&h); h *= 12; for(i = 1; i <= n; i++) scanf("%d",&f[i]); for(i = 1; i <= n; i++) scanf("%d",&d[i]); for(i = 1; i < n; i++) scanf("%d",&t[i]); t[0] = 0; //算出走1 到 n 个湖 每个值 for(i = 1; i <= n; i++){ memcpy(fs,f,sizeof(f)); h = h - t[i - 1]; //走路用掉的时间 time = h; int isEmpty = 0; //鱼 没了 或者 时间 没了结束 while(isEmpty != i && time > 0){ k = 1; //找出每次鱼最多的湖 for(j = 1; j <= i; j++){ if(fs[j] > fs[k]) k = j; } //ans[i][0] 存储第i个湖 钓鱼数 ans[i][0] += fs[k]; ans[i][k]++;//第K个湖钓鱼次数 增加一次 time--; //fs[k] 减少 d[k] fs[k] -= d[k]; if(fs[k] < 0){ fs[k] = 0; } isEmpty = 0; for(j = 1; j <= i; j++){ if(fs[j] == 0) isEmpty++; } } ans[i][1] += time; 剩余时间加到哪里》？》？？？？？？？？ If multiple plans exist, choose the one that spends as long as possible at lake 1 } k = 1; for(j = 1; j <= n; j++) if(ans[j][0] > ans[k][0]) k = j; for(j = 1; j <= n; j++){ printf("%d",ans[k][j]*5); if(j != n) printf(", "); else printf("/n"); } printf("Number of fish expected: %d/n",ans[k][0]); scanf("%d",&n); if(n != 0) printf("/n"); } getch(); return 0; }