poj1042 Gone Fishing

Gone Fishing

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

题意就是一个人去钓鱼，有n个鱼塘，如果在一个鱼塘钓鱼，这个鱼塘的鱼可能是减少的，所以你会换其他鱼塘钓鱼，当然，在这n-1段鱼塘间的路上也是会消耗时间的，给你个时间，你去求最多能得到多少鱼。

这个是经典贪心，黑书第一道。先上代码，题解日后写。

#include <iostream>
#include <cstdio>
using namespace std;

struct la
{
    int lake[30];
    int maxs;
};
int findbig(int a[],int begins,int ends)
{
    int last=begins,sum=a[begins];
    for(int i=begins+1; i<=ends; i++)
    {
        if(sum<a[i])
        {
            sum=a[i];
            last=i;
        }
    }
    return last;
}
int main()
{
    int n,h;
    struct la s[30];
    int fish[30],de[30],time[30];
    while(cin>>n&&n)
    {
        cin>>h;
        for(int i=1; i<=n; i++)
        {
            cin>>fish[i];
            fish[i]=max(fish[i],0);
        }
        for(int i=1; i<=n; i++) cin>>de[i];
        for(int i=1; i< n; i++) cin>>time[i];
        for(int i=1; i<=n; i++)
        {
            s[i].maxs=0;
            for(int j=1; j<=n; j++)
            {
                s[i].lake[j]=0;
            }
        }
        for(int i=1; i<=n; i++)
        {
            int now[30],hour,t,ans;
            for(int j=1; j<=n; j++)
                now[j]=fish[j];

                hour=12*h,t=0,ans=0;
                for(int k=1; k<i; k++)
                    hour-=time[k];
                    while(t<hour)
                    {
                        int m=findbig(now,1,i);
                        ans+=now[m];
                        s[i].lake[m]+=5;
                        now[m]=max(now[m]-de[m],0);
                        t++;
                    }
            s[i].maxs=ans;
        }
        int cnt=1;
        for(int i=1; i<=n; i++)
            if(s[cnt].maxs<s[i].maxs) cnt=i;
        for(int i=1; i<n; i++)
            printf("%d, ",s[cnt].lake[i]);
        printf("%d
",s[cnt].lake[n]);
        printf("Number of fish expected: %d

",s[cnt].maxs);

    }
    return 0;
}

View Code