Nyoj 30 Gone Fishing

题目来源：http://acm.nyist.net/JudgeOnline/problem.php?pid=30

这题有必要叙述一下，很好的贪心，借助黑书的思路叙述一下，这里我们把钓5分钟鱼称作一次钓鱼，首先枚举John需要走过的湖泊数目, 即假设他从湖泊1走到湖泊X，则路上花费的时间为：.在这个前提下，我们可以想象John可以从一个湖“瞬间移动到”另外一个湖，即任意时刻他都可以从1到X湖泊中任意一个去钓鱼。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

const int MAXN = 30;

int main()
{
    int n, i, j, iHour, iIniteFishNum[MAXN], iDec[MAXN], iRoadTime[MAXN], iStayTime[MAXN], iTempNum[MAXN], iTemStayTime[MAXN], iMaxNum;
    int iCurFishNum , iPos, iTempFishNum;
    while(scanf("%d", &n) &&n)
    {
        memset(iIniteFishNum, 0, sizeof(iIniteFishNum));
        memset(iDec, 0, sizeof(iDec));
        memset(iRoadTime, 0, sizeof(iRoadTime));
        memset(iStayTime, 0, sizeof(iStayTime));
        scanf("%d", &iHour);
        for(i = 1; i <= n; ++i)
            scanf("%d", &iIniteFishNum[i]);
        for(i = 1; i <= n; ++i)
            scanf("%d", &iDec[i]);
        for(i = 1; i < n; ++i)
            scanf("%d", &iRoadTime[i]);
        int iTime = iHour*12;
        iMaxNum = 0;
        for(i = 1; i <= n; ++i)
        {
            memset(iTemStayTime, 0, sizeof(iTemStayTime));
            for(j = 1; j <= i; ++j)
                iTempNum[j] = iIniteFishNum[j];
            int iWaste = 0, iResTime = 0;;
            for(j = 1; j < i; ++j)
                iWaste += iRoadTime[j];
            iResTime = iTime - iWaste;
            if(iResTime < 0)
                break ;
            iTempFishNum = 0;
            while(iResTime--)
            {
                iCurFishNum = 0, iPos = 1;
                for(j = 1; j <= i; ++j)
                {
                    if(iCurFishNum < iTempNum[j])
                    {
                        iCurFishNum = iTempNum[j];
                        iPos = j;
                    }
                }
                iTempFishNum += iCurFishNum;
                iTempNum[iPos] -= iDec[iPos];
                iTemStayTime[iPos]++;
            }
            if(iTempFishNum > iMaxNum)
            {
                iMaxNum = iTempFishNum;
                for(j = 1; j <= i; ++j)
                    iStayTime[j] = iTemStayTime[j];
            }
        }
        for(i = 1; i < n; ++i)
            printf("%d, ", iStayTime[i]*5);
        printf("%d\n", iStayTime[i]*5);
        printf("Number of fish expected: %d\n\n", iMaxNum);
    }
    return 0;
}