POJ-1157-LITTLE SHOP OF FLOWERS

题目来源：http://poj.org/problem?id=1157
题目内容：LITTLE SHOP OF FLOWERS
Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 21994 Accepted: 10166
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 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.
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
Source

IOI 1999

题目分析：
有F种花，可以摆放在V个位置，每一个位置对应每一种花都有一个美学值，且第i种花在j>i时只能放在j的左边，反之只能放在j的右边

我们定义dp[i][j]：将i种花放在j个花瓶中获得的最大美学值
这里要注意，花瓶的个数一定是大于等于花的种数的，换而言之，一个花瓶里最多出现一种花，可以没有花

状态转移方程：dp[i][j] = max(dp[i-1][j-1] + v[i][j], dp[i][j-1]);
//1.表示前i-1种花放了j-1个花瓶
//2.表示前i种花放了j个花瓶

for(int i = 1 ; i<= f ; i ++){
    for(int j = i ; j <= v ; j ++){
        dp[i][j] = dp[i-1][j-1] + v[i][j];//初始化
        if(j>i)
            dp[i][j] = max(dp[i-1][j-1] + v[i][j],dp[i][j-1]);
    }
}
cout <<dp[f][v] <<endl;