大一暑假第二周 动态规划 K - LITTLE SHOP OF FLOWERS

K - LITTLE SHOP OF FLOWERS（插花）

简单的dp思想
题目：
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.

输入：
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.

输出：
The first line will contain the sum of aesthetic values for your arrangement.

样例：
输入：
3 5
7 23 -5 -24 16
5 21 -4 10 23
-21 5 -4 -20 20
输出：
53

————————————————————————————————————————
http://poj.org/problem?id=1157
题意：
输入F束花 V个瓶子 每个瓶子插在各个瓶子是有各自的价值的 花必须插完 问最大的价值。
给你F束不同的花，在给你V个已经排列好位置的瓶子；重点是不同的花放进不同的瓶子里有不同的价值，请你求怎样插花才能得到最大价值。

思路：
假设第一束花放第一个花瓶中，那么第二束花就只能放第二个或后面的花瓶中；根据这个思路，最优思想就是
开一个双重for循环，第一层遍历插到了第几束花，第二层for循环对应该花可插的花瓶；并进行判断当前这个瓶子插花还是不插花，如：
dp[i][j]=max(dp[i][j-1],dp[i-1][j-1]+a[i][j]);
当然还要初始化，该题初始化为按顺序把花插入前几个花瓶中，先组成一种情况，后面好进行数据的更新。
————————————————————————————————————————
dp思想，博大精深！！！

代码：

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
/*
把i朵花插到j个花瓶的最大美观值=max{把i朵花插到j-1个
花瓶的最大美观值，把i-1朵花插到j-1个花瓶的最大美观值
+把第i朵花插到第j个花瓶的美观值}
*/
//自上而下进行dp，可始终保持右边最优。
int a[200][200];
int dp[200][200];
int main()
{
    int i,j,f,v,maxx;
    scanf("%d%d",&f,&v);
    for(i=1;i<=f;i++)
    {
        for(j=1;j<=v;j++)
        {
            scanf("%d",&a[i][j]);
        }
    }
    memset(dp,0,sizeof(dp));
    for(i=1;i<=f;i++)
    {
        dp[i][i]=dp[i-1][i-1]+a[i][i];
    }
    for(i=1;i<=f;i++)
    {
        for(j=i+1;j<=v;j++)
        {
            dp[i][j]=max(dp[i][j-1],dp[i-1][j-1]+a[i][j]);
        }
    }
    printf("%d\n",dp[f][v]);
    return 0;
}