动态规划和记忆化搜索一些理解（2）

        昨天写了一些动态规划和记忆化搜索的东西，今天就找了一个题目练习练习。题目来自PKU1157 花店问题。题目和代码可以参见最后。

这道题目是个确实是个典型的动态规划问题，看完题目后应该能找到最优子结构，设当前要求的花束数目为i，花瓶的数目为j，函数f(i, j)就表示在花束数目为i，花瓶数目为j时，并且一定在j花瓶中包括最后一束花时所得到的最大美感值（aesthetic value)，那么这个问题的动归方程就可以写为f(i, j) = MAX( f(i-1, k) + Value[i][j]),其中i-1 <= k <= j-1。

写出了动归方程，当然代码就好写了，当然不会用递归，因为那样的话肯定会超时，时间复杂度为指数增长，这里实现的方法依然是用空间换时间，开一个数组f[i][j]来计算，并且是从自底向上记录算出的数据，将来要用的时候就查。整个程序用动态规划通过本题的时间可以看到为0ms.非常快的。

非常高兴这又是一道我独立解决的动态规划题目，小庆祝一下。

LITTLE SHOP OF FLOWERS
Time Limit:1000MS  Memory Limit:10000K
Total Submit:2800 Accepted:1293

Description
You want to arrange the window of your flower shop in a most pleasant way. You have F bunches of flowers, each being of a different kind, and at least as many vases ordered in a row. The vases are glued onto the shelf and are numbered consecutively 1 through V, where V is the number of vases, from left to right so that the vase 1 is the leftmost, and the vase V is the rightmost vase. The bunches are moveable and are uniquely identified by integers between 1 and F. These id-numbers have a significance: They determine the required order of appearance of the flower bunches in the row of vases so that the bunch i must be in a vase to the left of the vase containing bunch j whenever i < j. Suppose, for example, you have bunch of azaleas (id-number=1), a bunch of begonias (id-number=2) and a bunch of carnations (id-number=3). Now, all the bunches must be put into the vases keeping their id-numbers in order. The bunch of azaleas must be in a vase to the left of begonias, and the bunch of begonias must be in a vase to the left of carnations. If there are more vases than bunches of flowers then the excess will be left empty. A vase can hold only one bunch of flowers.

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. 

					V A S E S
					1	2	3	4	5
Bunches		1 (azaleas)			7	23	-5	-24	16
		2 (begonias)			5	21	-4	10	23
		3 (carnations)			-21	5	-4	-20	20

According to the ta ble, 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.

Input

The first line contains two numbers: F, V.
The following F lines: Each of these lines contains V integers, so that Aij is given as the jth number on the (i+1)st line of the input file.

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 <= Aij <= 50 where Aij is the aesthetic value obtained by putting the flower bunch i into the vase j.

Output
The first line will contain the sum of aesthetic values for your arrangement.

Sample Input

3 5
7 23 -5 -24 16
5 21 -4 10 23
-21 5 -4 -20 20

Sample Output

53

cpp 代码

1. #include <stdio.h></stdio.h><iostream></iostream> <cstdio></cstdio><stdio.h></stdio.h><stdio.h></stdio.h><stdio.h></stdio.h>
2. #define MIN -100000000
4. using namespace std;  
6. int main()   
7. {   
8.     int f[100][100];   
9.     int i, j ,k;   
10.     int F, V;   
11.     int value[100][100];   
12.     int val;   
13.     int max = MIN;   
14.   
15.     scanf("%d %d", &F, &V);   
16.   
17.     for (i = 0; i < F; i++ )   
18.         for (j = 0; j < V; j++)   
19.         {   
20.             scanf("%d", &value[i][j]);   
21.             f[i][j] = MIN;   
22.         }   
23.   
24.     for (i = 0; i < V; i++)   
25.         f[0][i] = value[0][i];   
26.            
27.     for (i = 1; i < F; i++)   
28.         for (j = i; j < V; j++)   
29.             for (k = i-1; k < j; k++)   
30.                 if ((val = value[i][j] + f[i-1][k]) > f[i][j] )   
31.                     f[i][j] = val;   
32.   
33.     for (i = F-1; i < V; i++)   
34.         if (f[F-1][i] > max)   
35.             max = f[F-1][i];   
36.   
37.         printf("%d\n", max);   
38.         return 0;      
39. }