POJ 1042-Gone Fishing（贼恶心的贪心）

c

Time Limit: 2000MS		Memory Limit: 32768K
Total Submissions: 37181		Accepted: 11546

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个湖可以钓鱼，第i个湖的鱼的原始数量是f[i]，每在i湖钓一次鱼，花费5min获得f[i]数量的鱼，i湖鱼的数量同时也会减少d[i]，你有h个小时可以钓鱼，你最开始在第一个湖，同时你可以花费t[i]*5min的时间走到下一个湖，求你可以获得的最大鱼的数量，和在每个湖钓鱼花费的时间，如果数量相等，则输出在序号小的湖花费时间多的那个方案。

解题思路： 读懂题目后自己模拟了半天，还是没有思路，只是想出钓鱼是一直往后面的湖一个一个的钓，不会走回头路（干嘛要回来，浪费时间啊，还不如开始就在这里钓个够），最后还是无奈的去看题解，果然是不看题解不会做题，你只要暴力依此枚举在那个湖结束钓鱼，然后在减掉走路花费的时间，接下来就表示你可以不花费时间就在前面这几个湖随便移动了，每次选择鱼数量最大的湖钓就可以了，记录下每个湖钓鱼的时间和总数量输出即可，至于那个序号的问题，你每次都是从第一个湖开始找的，所以，一定是满足题意的，最后再把剩余的时间都加在第一个湖上即可。

AC代码： （其实我感觉你看了题解）

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<queue>
#include<math.h>
#include<string.h>
typedef long long ll;
using namespace std;
const int mod = 10;
const int N = 30;
const int INF = 1e9;

int dirx[4] = {1, 0, -1, 0};
int diry[4] = {0, 1, 0, -1};

int n, h, f[N], d[N], t[N], sumt, cost[N], idx, co, id;
int lack[N], L[N], F[N], T;

int main()
{
    while(~scanf("%d", &n)) {
        if(n == 0) break;
        scanf("%d", &h);
        int ans = 0;
        T = 0;
        co = 0;
        sumt = h*12;
        memset(cost, 0, sizeof(cost));
        memset(L, 0, sizeof(L));
        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 = 1; i < n; i ++) {
            scanf("%d", &t[i]);
            cost[i] = cost[i-1] + t[i];
        }
        for(int i = 1; i <= n; i ++) { //枚举在哪个湖结束钓鱼
            for(int k = 1;k <= n; k ++)
                F[k] = f[k];
            int t = sumt - cost[i-1];
            int get = 0;
            memset(lack, 0, sizeof(lack));
            while(t > 0) {
                int mm = 0;
                for(int j = 1; j <= i; j ++) {
                    if(F[j] > mm) {
                        idx = j;
                        mm = F[j];
                    }
                }
                if(mm > 0) {
                    lack[idx] ++;
                    F[idx] -= d[idx];
                    get += mm;
                }
                t --;
            }
            if(get > ans) { //更新鱼的数量
                co = cost[i-1];
                ans = get;
                T = 0;
                for(int i = 1; i <= n; i ++) {
                    L[i] = lack[i];
                    T += L[i];
                }
            }
        }
        printf("%d", ((sumt-T)+L[1]-co)*5);
        for(int i = 2; i <= n; i ++)
            printf(", %d", L[i]*5);
        printf("\nNumber of fish expected: %d\n\n", ans);
    }
    return 0;
}