LITTLE SHOP OF FLOWERS（dp）

G - LITTLE SHOP OF FLOWERS

Time Limit:1000MS     Memory Limit:10000KB     64bit IO Format:%I64d & %I64u

Submit  Status  Practice  POJ 1157

Appoint description:  System Crawler  (2015-11-07)

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 A_ij is given as the j^th 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

这题一开始我是自下而上的去求最大值，结果Wa了，最后看了看题解后，都是自上而下的，不过自上而下却是能达到最优的，因为我每次都保证最右边是最优，就能使得下一步求值时也是最优。有点像背包，但是却没想出来。

AC代码：

#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<cstdio>
#include<set>
using namespace std;
#define T 105
#define mod 10007
#define inf 0x3f3f3f3f
typedef long long ll;
int dp[T][T];
int main()
{
#ifdef zsc
	freopen("input.txt","r",stdin);
#endif
	int data[T][T],n,m,i,j;
	while(~scanf("%d%d",&n,&m))
	{
		for(i=1;i<=n;++i){
			for(j=1;j<=m;++j){
				scanf("%d",&data[i][j]);
			}	
		}
		for(i=1;i<=n;++i){
			for(j=i;j<=m;++j){
				dp[i][j] = dp[i-1][j-1]+data[i][j];
				if(j>i)dp[i][j] = max(dp[i][j],dp[i][j-1]);
			}
		}
		printf("%d\n",dp[n][m]);
	}
	return 0;
}

Wa代码：

#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<cstdio>
#include<set>
using namespace std;
#define T 105
#define mod 10007
#define inf 0x3f3f3f3f
typedef long long ll;
int dp[T][T];
int main()
{
#ifdef zsc
	freopen("input.txt","r",stdin);
#endif
	int data[T][T],n,m,i,j,k;
	while(~scanf("%d%d",&n,&m))
	{
		for(i=0;i<n;++i){
			for(j=0;j<m;++j){
				scanf("%d",&data[i][j]);
				dp[i][j] = -inf;
				if(i==n-1)dp[i][j] = data[i][j];
			}	
		}
		for(i=n-2;i>=0;--i){
			for(j=n+i-1;j>=i;--j){
				for(k=j+1;k<m;++k){
				  if(dp[i][j]<dp[i+1][k]+data[i][j]){
					  dp[i][j]=dp[i+1][k]+data[i][j];
				  }
				}
			}
		}
		if(n!=1){
			for(i=0,k=-inf;i<n;++i){
				k = max(k,dp[0][i]);
			}
		}
		else
		{
			for(i=0,k=-inf;i<m;++i){
				k = max(k,dp[0][i]);
			}
		}
		printf("%d\n",k);
	}
	return 0;
}