LITTLE SHOP OF FLOWERS PROBLEM You want to arrange the window of your flower shop in a most
pleasant way. You have Each vase has a distinct characteristic (just like flowers do). Hence, putting a bunch of flowers in a vase results in a certain aesthetic value, expressed by an integer. The aesthetic values are presented in a table as shown below. Leaving a vase empty has an aesthetic value of 0.
According to the table, azaleas, for example, would look great in vase 2, but they would look awful in vase 4. To achieve the most pleasant effect you have to maximize the sum of aesthetic values for the arrangement while keeping the required ordering of the flowers. If more than one arrangement has the maximal sum value, any one of them will be acceptable. You have to produce exactly one arrangement.
- 1 <=
*F*<= 100 where*F*is the number of the bunches of flowers. The bunches are numbered 1 through*F*. *F*<=*V*<= 100 where*V*is the number of vases.- -50 <=
*A*<= 50 where_{ij}*A*is the aesthetic value obtained by putting the flower bunch_{ij }*i*into the vase*j*.
INPUT The input is a text file named - The first line contains two numbers:
*F*,*V*. - The following
*F*lines: Each of these lines contains*V*integers, so that*A*is given as the_{ij}*j*number on the (^{th}*i*+1)^{st}line of the input file.
OUTPUT The output must be a text file named - The first line will contain the sum of aesthetic values for your arrangement.
- The second line must present the arrangement as a list of
*F*numbers, so that the*k*’th number on this line identifies the vase in which the bunch*k*is put.
EXAMPLE flower.inp:
flower.out:
EVALUATION Your program will be allowed to run 2 seconds. No partial credit can be obtained for a test case. |