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 0Sample 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: 724Source
East Central North America 1999
/* 刘汝佳的书里面有 贪心的算法 枚举要经过的鱼塘数，接着减去路上花去的时间，就可以认为在贪心的时候，人在鱼塘间的移动是瞬时的，这一点要想清楚 还有就是选择在每次钓一次鱼后就选择每次贪心即可 总的时间效率是0(kn^2) 如果用堆优化了，还可以更快，到达0(kn*logn) */ #include<cstdio> int main() { int n,h; int num=1; int f[30],d[30],t[30],s[30]; while(scanf("%d",&n)!=EOF) { if(n==0) break; if(num!=1) printf("/n"); scanf("%d",&h); h=h*12; for(int i=1; i<=n; i++) scanf("%d",&f[i]); for(int i=1; i<=n; i++) scanf("%d",&d[i]); for(int i=2; i<=n; i++) scanf("%d",&t[i]); t[1]=0; int ff[30],ss[30],sum=0,maxn=-1; for(int i=1; i<=n; i++) { for(int j=1; j<=n; j++) ff[j]=f[j]; for(int j=1; j<=n; j++) ss[j]=0; h=h-t[i]; sum=0; for(int j=1; j<=h; j++) { int max=1; for(int k=1; k<=i; k++) if(ff[k]>ff[max]) max=k; if(ff[max]<=0) break; sum+=ff[max]; ff[max]-=d[max]; ss[max]+=5; } if(sum>maxn) { maxn=sum; int num=0; for(int j=1; j<=n; j++) { s[j]=ss[j]; num+=ss[j]; } s[1]=s[1]+h*5-num; } } for(int i=1; i<n; i++) printf("%d, ",s[i]); printf("%d/n",s[n]); printf("Number of fish expected: %d/n",maxn); num=2; } return 0; }
