POJ 1157 LITTLE SHOP OF FLOWERS (插画的最大值_经典的动态规划DP)
来源:互联网 发布:电力scada源码 编辑:程序博客网 时间:2024/05/04 15:10
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.
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.
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)
723-5-24162 (begonias)
521-410233 (carnations)
-21
5-4-2020According 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 57 23 -5 -24 165 21 -4 10 23-21 5 -4 -20 20
Sample Output
53
思路:一道dp题目,还是蛮有意思的。
如果花瓶数量和花的数量一样,那么只有一种插花的方法;
如果花瓶数大于花的数量,那么就考察最后一个花瓶是否插花,可以归结为两个相应的最优子问题。
具体的状态方程如下:
用state[V][F]记录状态, V是瓶子的数量,F是花的数量。
state[i][j] = state[i-1][j-1] + value[i][j] if i == j
state[i][j] = max { state[i-1][j-1] + value[i][j], state[i][j-1] } if i < j
#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int dp[111][111];int a[111][111];int main(){int n,m,i,j;cin>>n>>m;for(i=1;i<=n;i++) {for(j=1;j<=m;j++) {cin>>a[i][j];dp[i][j]=0;}}dp[1][1]=a[1][1];for(j=2;j<=m;j++) dp[1][j]=max(dp[1][j-1],a[1][j]);for(i=2;i<=n;i++) {for(j=i;j<=m;j++) {if(i==j) dp[i][j]=dp[i-1][j-1]+a[i][j];else dp[i][j]=max(dp[i-1][j-1]+a[i][j],dp[i][j-1]);}}printf("%d\n",dp[n][m]);return 0;}
0 0
- POJ 1157 LITTLE SHOP OF FLOWERS (插画的最大值_经典的动态规划DP)
- poj 动态规划DP - 1157 LITTLE SHOP OF FLOWERS
- POJ 1157 - LITTLE SHOP OF FLOWERS (动态规划)
- POJ 1157 LITTLE SHOP OF FLOWERS(动态规划)
- POJ-1157 LITTLE SHOP OF FLOWERS(动态规划)
- POJ 1157 LITTLE SHOP OF FLOWERS(动态规划)
- POJ LITTLE SHOP OF FLOWERS(动态规划)
- POJ 1157 LITTLE SHOP OF FLOWERS(动态规划)
- POJ 1157 LITTLE SHOP OF FLOWERS(动态规划)
- POJ 1157 LITTLE SHOP OF FLOWERS (DP)
- POJ 1157 LITTLE SHOP OF FLOWERS ( DP )
- POJ 1157-LITTLE SHOP OF FLOWERS(DP)
- poj 1157 LITTLE SHOP OF FLOWERS dp
- poj 1157 LITTLE SHOP OF FLOWERS(DP)
- 【DP】POJ-1157 LITTLE SHOP OF FLOWERS
- POJ 1157 LITTLE SHOP OF FLOWERS(DP)
- poj 1157 LITTLE SHOP OF FLOWERS(DP)
- poj - 1157 - LITTLE SHOP OF FLOWERS(dp)
- Ubuntu设置代理和例外
- ubuntu14.04 搭建java环境
- hdu2222Keywords Search AC自动机模板题
- 4_蒙特卡罗算法求圆周率PI
- Cocos2d-x中的引用计数(Reference Count)和自动释放池(AutoReleasePool)
- POJ 1157 LITTLE SHOP OF FLOWERS (插画的最大值_经典的动态规划DP)
- ajax的url调用Struts 2的action方法,浏览器提示Not Found
- 单例模式及单例类的两种实现
- Machine Intelligence(Nature Insight 2015.5.28/Vol 521/Issue No 7553)
- 基于飞思卡尔i.MX 6Quad Sabrelite开发板的触摸屏调试
- TCP/IP、Http、Socket的区别
- 图像匹配之归一化积相关灰度匹配
- HDU2896病毒侵袭 AC自动机
- hdu5024Wang Xifeng's Little Plot 暴力枚举