nyoj30Gone Fishing

Gone Fishing

Time Limit: 2000MS		Memory Limit: 32768K
Total Submissions: 30566		Accepted: 9223

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 

题意
 	在一条水平的路边有n个湖可以钓鱼，编号一次为1.2.3...n，John有h个小时的时间用于钓鱼，他希望用这些时间钓到尽量多的鱼，他从第一个湖出发，有选择的在一些湖边停留一定的时间钓鱼，最后在某个湖边停止钓鱼，为了制定好的钓鱼计划，John测出了从第 i 个湖走到第 i+1 个湖需要的时间为 5*ti 分钟，还测出了在第 i 个湖边初始的钓鱼数目 fi 和5分钟后减少的数目 di ，求出钓鱼最多的方案，若存在多个最优方案，求出在第一个湖钓鱼时间最长的，若还有多个，则输出在第二个钓鱼最长的方案

#include<iostream>
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<ctype.h>
#include<stdlib.h>
#include<string>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<list>
#include<queue>
#include<stack>
#include<iomanip>
#include<numeric>
//#include <istream>　　　　 //基本输入流
//#include <ostream>　　　　 //基本输出流
//#include <sstream>　　　　 //基于字符串的流
//#include <utility>　　　　 //STL 通用模板类
//#include <complex.h>　　 //复数处理
//#include <fenv.h>　　　　//浮点环境
//#include <inttypes.h>　　//整数格式转换
//#include <stdbool.h>　　 //布尔环境
//#include <stdint.h>　　　//整型环境
//#include <tgmath.h>　　　//通用类型数学宏
#define L(a,b,c) for(int a = b;a >= c;a --)
#define M(a,b,c) for(int a = b;a <= c;a ++)
#define N(a,b) memset(a,b,sizeof(a));
#define MAXX(a,b)   ((a)>(b)?a:b)
#define MINN(a,b)   ((a)<(b)?a:b)
const int MAX=1<<30;
const int MIN=-MAX;
const int M=30;
using namespace std;
int f[M],d[M],t[M],plan[M],best,n;

///此人在第pos个湖泊钓鱼结束，用于钓鱼的时间为time，即为钓鱼time次，该函数采用贪心思想构造它的计划，可以认为他能从一个湖瞬间转移到另一个湖，即在任意时刻都可以从湖1到湖pos任意选择一点进行钓鱼。
void greedy(int pos,int time)       ///从湖1到湖pos结束，花费时间time（不含路程）的钓鱼计划
{
    if(time<=0)         ///终止条件
        return ;
    int i,j;
    int fish[M];   
    int p[M];
    int t=0;
    for(i=0; i<pos; i++)
        fish[i]=f[i];
    N(p,0)
    for(i=0; i<time; i++)           ///在时间time内，选择鱼最多的湖钓鱼，如果鱼没有了，就把时间放在湖1
    {
        int max=0;          ///鱼最多的湖中鱼的数量
        int id=-1;             ///鱼最多的湖中鱼的编号
        for(j=0; j<pos; j++)        ///查找鱼最多的湖中鱼的数量和鱼的编号，记录
            if(fish[j]>max)
            {
                max=fish[j];
                id=j;
            }
        if(id!=-1)      ///找到的话，更新相应位置的值
        {
            ++p[id];
            fish[id]-=d[id];
            t+=max;
        }
        else ++p[0];    ///没有找到（从湖1到湖pos全部都钓完了），就把时间放在湖1上
    }
    if(t>best)
    {
        best=t;     ///最优值
        N(plan,0)
        for(i=0; i<pos; i++)        ///最优解
            plan[i]=p[i];
    }


}


int main()
{
    int h;
    while(cin>>n,n)
    {
        best=0;
        int time=0;
        cin>>h;     ///钓鱼的时间
        h=h*60/5;       ///钓鱼的次数和路上花费的时间
        for(int i=0;i<n;i++)    ///每个湖预计钓到的数量
            cin>>f[i];
        for(int i=0;i<n;i++)        ///每个湖预计钓到数量的递减值
            cin>>d[i];
        for(int i=0;i<n-1;i++)      ///路上花费的时间
            cin>>t[i];
        int i;
        for(i=1; i<=n&&h-time; i++)     
        {
            greedy(i,h-time);
            time+=t[i-1];
        }
        ///输出时要把5乘回去，就变成实际钓鱼时间
        printf("%d,",plan[0]*5);
        for(i=1; i<n-1; i++)
            printf(" %d,",plan[i]*5);
        printf(" %d\n",plan[n-1]*5);
        printf("Number of fish expected: %d\n\n",best);
    }
    return 0;
}