LITTLE SHOP OF FLOWERS
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 18300 | Accepted: 8435 |
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) |
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
题意:
给出 F(1 ~ 100) 和 V ( F ~ 100),代表有 F 个花种,V 个花瓶,现在每朵花都要选一个花瓶放置,花对应所在花瓶对应会有一个健康值。问如何放置使总和值最大,且花种的摆放顺序一定要递增。
思路:
DP。 dp [ i ] [ j ] 为第 i 种花放置在 j 花瓶时所达到的最大值,所以 dp [ i ] [ j ] = max { dp [ i - 1 ] [ k ] ( 1 <= k < j) } + num [ i ] [ j ]。最后比较最大值输出即可。
AC:
#include <cstdio> #include <cstring> #include <algorithm> using namespace std; const int INF = 99999999; int num[105][105], dp[105][105]; int main() { int n, m; scanf("%d%d", &n, &m); for (int i = 1; i <= n; ++i) { for (int j = 1; j <= m; ++j) { scanf("%d", &num[i][j]); if (i == 1) { dp[i][j] = num[i][j]; ans = max(ans, dp[i][j]); } } } int ans = -INF; for (int i = 2; i <= n; ++i) { for (int j = 1; j <= m; ++j) { int Max = -INF; for (int k = 1; k < j; ++k) { Max = max(Max, dp[i - 1][k]); } dp[i][j] = Max + num[i][j]; if (i == n) ans = max(ans, dp[i][j]); } } printf("%d\n", ans); return 0; }
相关推荐
Pku acm 第1157题 LITTLE SHOP OF FLOWERS c代码,有详细的注释,动态规划
《The Little Book of Deep Learning》本书共140页,作者François Fleuret是瑞士日内瓦大学计算机科学教授,Idiap研究所外部研究员,Neural Concept SA公司联合创始人。 历史上,深度学习属于统计机器学习这个更大...
The little book of Thermofluids
A Little Book of R For Time Series R语言时间序列分析教程PDF
The Little Book of Semaphores is a textbook that introduces the principles of synchronization for concurrent programming. In most computer science curricula, synchronization is a module in an ...
a little book of r for time series a little book of r for time series 时间序列 R语言
Downey写的The Little Book of Semaphores One reason students don’t understand this material deeply is that it takes more time, and more practice, than most classes can spare. Synchronization is just ...
the Little Book of Common Sense Investing
a little book of R for biomedical statistics
这本书是一个非常有名的画师画的,内容很是有趣,适合英语中度学习者,全英文没有汉语
A Little Book of Python for Multivariate Analysis.epub Algorithmic Information Theory - Review For Physicists And Natural Scientists.pdf Artificial Inteligence - Leonardo Araujo dos Santos.epub ...
This Little Black Book shows you how to take charge of a big project, define it, and then break it down into smaller, more manageable phases. You will learn how to control a budget and schedule and...
通过小型独立的示例程序,对Ruby编程进行简单,分步的介绍。
中文版见:数学名著译丛 博大精深的素数__(加)P._里本伯姆著;孙淑玲,冯克勤译.pdf
外国人写的SAS入门教材,思路清晰,举例详细。
This is a simple introduction to time series analysis using the R statistics software.
unix操作系统的小知识(Little knowledge of UNIX operating system).doc
经典的信号量系列丛书, 豆瓣评分8.0, 在原版的基础上为PDF添加了目录, 更便于阅读
http://www.amazon.com/Pretty-Little-Liars-Box-Set/dp/0061801313/ref=sr_1_6?ie=UTF8&qid=1346596985&sr=8-6&keywords=Pretty+Little+Liars About the Author Sara Shepard is the author of two New York Times...