poj1157LITTLE SHOP OF FLOWERS
来源:互联网 发布:java在线笔试题 编辑:程序博客网 时间:2024/06/03 11:56
LITTLE SHOP OF FLOWERS
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 21456 Accepted: 9923
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
Source
IOI 1999
题意:给出f朵花,v个花瓶,要把花都插到花瓶里去,而且花的顺序不能改变,编号从小到大往后插,每朵花放到花瓶里都会有一定的价值,问如何放才能产生最大的价值
思路:我们设dp[i][j]表示处理到第i朵花,然后把第i朵花放到第j个花瓶里时所能获得的最大价值;
显然 dp[i][j] = max(dp[i - 1][k]) + val[i][j],其中k< j val[i][j]表示把第i朵花放到第j个花瓶里产生的价值
注意初始化的时候
#include <algorithm>#include <iostream>#include <cstring>#include <string>#include <cstdio>#include <queue>#include <vector>#include <cmath>#include <map>#include <set>using namespace std;#define N 600#define INF 0x3f3f3f3fint mapt[N][N];int dp[N][N];int X[4]={0,0,1,-1};int Y[4]={1,-1,0,0};int n,m;int dfs(int x,int y){ int maxi=0; if(dp[x][y]>0) return dp[x][y]; for(int i=0;i<4;i++) { int tx=x+X[i]; int ty=y+Y[i]; if(tx<1||tx>n||ty<1||ty>m) continue; if(mapt[x][y]<=mapt[tx][ty]) continue; dp[x][y]=max(dp[x][y],dfs(tx,ty)+1); } return dp[x][y];}int main(){ ios::sync_with_stdio(0); memset(dp,-INF,sizeof(dp));//因为有负权 memset(mapt,0,sizeof(mapt)); cin>>n>>m; int maxi=-INF; for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) cin>>mapt[i][j]; for(int i=0;i<=m;i++) dp[0][i]=0; dp[1][1]=mapt[1][1]; for(int i=1;i<=n;i++) { for(int j=1;j<=m;j++) { for(int k=1;k<j;k++) { dp[i][j] = max(dp[i][j],dp[i-1][k]+mapt[i][j]); } } } for(int i=1;i<=m;i++) maxi = max(maxi,dp[n][i]); cout<<maxi<<endl;// return 0;}
LITTLE SHOP OF FLOWERS
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 21456 Accepted: 9923
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
Source
IOI 1999
题意:给出f朵花,v个花瓶,要把花都插到花瓶里去,而且花的顺序不能改变,编号从小到大往后插,每朵花放到花瓶里都会有一定的价值,问如何放才能产生最大的价值
思路:我们设dp[i][j]表示处理到第i朵花,然后把第i朵花放到第j个花瓶里时所能获得的最大价值;
显然 dp[i][j] = max(dp[i - 1][k]) + val[i][j],其中k< j val[i][j]表示把第i朵花放到第j个花瓶里产生的价值
注意初始化的时候
#include <algorithm>#include <iostream>#include <cstring>#include <string>#include <cstdio>#include <queue>#include <vector>#include <cmath>#include <map>#include <set>using namespace std;#define N 600#define INF 0x3f3f3f3fint mapt[N][N];int dp[N][N];int X[4]={0,0,1,-1};int Y[4]={1,-1,0,0};int n,m;int dfs(int x,int y){ int maxi=0; if(dp[x][y]>0) return dp[x][y]; for(int i=0;i<4;i++) { int tx=x+X[i]; int ty=y+Y[i]; if(tx<1||tx>n||ty<1||ty>m) continue; if(mapt[x][y]<=mapt[tx][ty]) continue; dp[x][y]=max(dp[x][y],dfs(tx,ty)+1); } return dp[x][y];}int main(){ ios::sync_with_stdio(0); memset(dp,-INF,sizeof(dp));//因为有负权 memset(mapt,0,sizeof(mapt)); cin>>n>>m; int maxi=-INF; for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) cin>>mapt[i][j]; for(int i=0;i<=m;i++) dp[0][i]=0; dp[1][1]=mapt[1][1]; for(int i=1;i<=n;i++) { for(int j=1;j<=m;j++) { for(int k=1;k<j;k++) { dp[i][j] = max(dp[i][j],dp[i-1][k]+mapt[i][j]); } } } for(int i=1;i<=m;i++) maxi = max(maxi,dp[n][i]); cout<<maxi<<endl;// return 0;}
阅读全文
0 0
- poj1157LITTLE SHOP OF FLOWERS
- poj1157LITTLE SHOP OF FLOWERS
- poj1157LITTLE SHOP OF FLOWERS
- POJ1157LITTLE SHOP OF FLOWERS
- POJ1157LITTLE SHOP OF FLOWERS【dp】
- poj1157LITTLE SHOP OF FLOWERS(简单DP)
- poj1157Little Shop of Flowers(动态规划题)
- POJ_1157_LITTLE SHOP OF FLOWERS
- LITTLE SHOP OF FLOWERS
- poj_1157LITTLE SHOP OF FLOWERS
- LITTLE SHOP OF FLOWERS
- LITTLE SHOP OF FLOWERS
- LITTLE SHOP OF FLOWERS
- LITTLE SHOP OF FLOWERS
- LITTLE SHOP OF FLOWERS
- LITTLE SHOP OF FLOWERS
- POJ1157 LITTLE SHOP OF FLOWERS
- pku1157 LITTLE SHOP OF FLOWERS
- 计算AUC和绘制ROC曲线
- kafka的高可用和一致性探究
- Latex参考文献字体样式修改
- delete from和truncate table的区别
- C++ boost thread组件, 编译
- poj1157LITTLE SHOP OF FLOWERS
- Fliptile POJ
- 解决Android SDK Manager无法加载可更新包问题
- Ubuntu下搭建smaba
- MySQL的if,case语句使用总结
- 2017 429 ichunqiu ctf smallest(pwn300) writeup
- JAVA 注解的学习和对Spring注解的理解
- win10 EFI文件夹删除了,引导进不去了,该怎么办?
- 编程之美2.2 不要被阶乘吓倒