Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 21456 | Accepted: 9923 |
Description
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
Sample Input
3 5 7 23 -5 -24 16 5 21 -4 10 23 -21 5 -4 -20 20
Sample Output
53
Source
题意:给出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 0x3f3f3f3f
int 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;
}
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 21456 | Accepted: 9923 |
Description
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
Sample Input
3 5 7 23 -5 -24 16 5 21 -4 10 23 -21 5 -4 -20 20
Sample Output
53
Source
题意:给出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 0x3f3f3f3f
int 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;
}