POJ 1157 LITTLE SHOP OF FLOWERS【基础DP】

最新推荐文章于 2017-07-30 09:51:13 发布

AC_Dreameng

最新推荐文章于 2017-07-30 09:51:13 发布

阅读量941

点赞数

分类专栏： ACM_DP POJ ACM_HDU刷题录文章标签： POJ1157 LITTLE SHOP OF FLOWE 基础DP

本文链接：https://blog.csdn.net/hurmishine/article/details/70233380

版权

这是一道关于动态规划的问题，题目要求在保持花朵顺序不变的情况下，将f朵花插入v个花瓶中以获得最大美学价值。每个花瓶与花朵的组合都有特定的价值Aij。通过定义dp[i][j]表示处理到第i朵花并将其放入第j个花瓶时的最大价值，可以得出状态转移方程dp[i][j] = max(dp[i - 1][k]) + val[i][j]，其中k < j。给出了三篇AC代码链接作为解题参考。

摘要由CSDN通过智能技术生成

LITTLE SHOP OF FLOWERS

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 21366		Accepted: 9876

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.