1 //============================================================================
  2 // Name        : test.cpp
  3 // Author      : 
  4 // Version     :
  5 // Copyright   : Your copyright notice
  6 // Description : Hello World in C++, Ansi-style
  7 //============================================================================
  8 
  9 #include <iostream>
 10 #include <math.h>
 11 #include <stdio.h>
 12 #include <cstdio>
 13 #include <algorithm>
 14 #include <string.h>
 15 #include <cstring>
 16 #include <queue>
 17 #include <vector>
 18 #include <functional>
 19 #include <cmath>
 20 #define SCF(a) scanf("%d", &a)
 21 #define IN(a) cin>>a
 22 #define FOR(i, a, b) for(int i=a;i<b;i++)
 23 typedef long long Int;
 24 using namespace std;
 25 
 26 int main()
 27 {
 28     int n, h; //n lakes, h hours = h*12 "5 minutes"
 29     int fish[30]; //initial fish number
 30     int decrease[30]; //decrese unit
 31     int time[30]; //walk time
 32     int tcase = 0;
 33     int stay[30]; //time that stay at lake i
 34     int take[30]; //time to take for people walk from lake 0 to lake i;
 35     while (SCF(n) && n)
 36     {
 37         if (tcase >= 1)
 38             printf("\n");
 39         SCF(h);
 40         FOR(i, 0, n)
 41             SCF(fish[i]);
 42         FOR(i, 0, n)
 43             SCF(decrease[i]);
 44         FOR(i, 0, n - 1)
 45             SCF(time[i]);
 46         FOR(i, 0, n)
 47             stay[i] = 0;
 48 
 49         take[0] = 0;
 50         FOR(i, 1, n)
 51             take[i] = take[i - 1] + time[i-1];
 52         
 53         int maxFish = 0;
 54         int left[30]; //record available fish for each lake
 55         int cfish = 0; //total fish that can get for current strategy
 56         int cstay[30]; //record the time stay at each lake
 57         int ctime = h * 12;
 58         
 59         FOR(i, 0, n) //fishing destination is lake i
 60         {
 61             ctime = h * 12;
 62             cfish = 0;
 63 
 64             ctime -= take[i];
 65             FOR(j, 0, n)
 66             {
 67                 left[j] = fish[j];
 68                 cstay[j] = 0;
 69             }
 70             
 71             while (ctime > 0)
 72             {
 73                 int cmax = 0;
 74                 FOR(j, 0, i+1)
 75                 {
 76                     if (left[j] > left[cmax])
 77                         cmax = j;
 78                 }
 79                 cfish += left[cmax];
 80                 left[cmax] = max(0, left[cmax] - decrease[cmax]);
 81                 cstay[cmax] += 5;
 82                 ctime -= 1;
 83             }
 84 
 85             if (cfish > maxFish)
 86             {
 87                 maxFish = cfish;
 88                 FOR(j, 0, n)
 89                     stay[j] = cstay[j];
 90             }
 91             else if (cfish == maxFish)
 92             {
 93                 FOR(j, 0, n)
 94                 {
 95                     if (cstay[j] > stay[j])
 96                     {
 97                         FOR(z, j, n)
 98                             stay[z] = cstay[z];
 99                         break;
100                     }
101                     else if (cstay[j] < stay[j])
102                         break;
103                 }
104             }
105         }
106 
107         printf("%d", stay[0]);
108         FOR(i, 1, n)
109             printf(", %d", stay[i]);
110         printf("\n");
111         printf("Number of fish expected: %d\n", maxFish);
112         tcase++;
113     }
114     return 0;
115 }