POJ1157 LITTLE SHOP OF FLOWERS
来源:互联网 发布:网络主播排行榜2017 编辑:程序博客网 时间:2024/05/18 02:03
一种dp[i][j]表示第i束花插入第[j]个瓶子里面所获得的最大的美观程度。则状态转移函数可以表示为dp[i][j]=max(dp[i-1][k]+a[i][j])其中i-1<=k<j;
#include<iostream>#include<cstdio>#include<algorithm>#include<cstring>#include<string>#include<queue>#include<cmath>#include<memory.h>using namespace std;int a[102][102];int dp[102][102];int f,v;void clear(){memset(a,0,sizeof(a));memset(dp,0,sizeof(dp));}int main(){int i,j,k;while(cin>>f>>v){clear();for(i=0;i<f;i++){for(j=0;j<v;j++){scanf("%d",&a[i][j]);}}for(i=0;i<v;i++)dp[0][i]=a[0][i]; //进行初始化,从第一束花插入第i个瓶子里面 for(i=1;i<f;i++){for(k=i;k<v;k++){dp[i][k]=-100000; for(j=i-1;j<k;j++)//第i束花插入第k个瓶子里面 {dp[i][k]=max(dp[i][k],dp[i-1][j]+a[i][k]); //取其中的最大值 }}}int maxn=dp[f-1][f-1];for(i=f-1;i<v;i++)maxn=max(maxn,dp[f-1][i]);cout<<maxn<<endl;}return 0;}
- POJ1157 LITTLE SHOP OF FLOWERS
- poj1157 LITTLE SHOP OF FLOWERS
- POJ1157 LITTLE SHOP OF FLOWERS
- poj1157 LITTLE SHOP OF FLOWERS
- poj1157 LITTLE SHOP OF FLOWERS
- poj1157 - LITTLE SHOP OF FLOWERS
- POJ1157 LITTLE SHOP OF FLOWERS
- POJ1157 LITTLE SHOP OF FLOWERS
- poj1157 LITTLE SHOP OF FLOWERS (dp)
- POJ1157 LITTLE SHOP OF FLOWERS DP
- POJ1157——LITTLE SHOP OF FLOWERS
- POJ1157 LITTLE SHOP OF FLOWERS DP
- [背包]poj1157 LITTLE SHOP OF FLOWERS
- poj1157 LITTLE SHOP OF FLOWERS-dp
- poj1157 LITTLE SHOP OF FLOWERS(dp)
- POJ1157 LITTLE SHOP OF FLOWERS题解动态规划DP
- 【POJ1157】LITTLE SHOP OF FLOWERS (简单动态规划)
- POJ1157 LITTLE SHOP OF FLOWERS(动态规划DP)
- Android的webview加载本地html、本apk内html和远程URL
- 东软---实习报告
- c# 调用 pdf2swf.exe
- jar(包)
- 动态规划 -- 最长公共子序列
- POJ1157 LITTLE SHOP OF FLOWERS
- Linux运维
- 如何预置APK
- gevent pywsgi overflow
- java获取当前时间最接近的刻度时间(00,15,30,45)
- 笔试面试题之递归
- 回文字符串
- C语言打印自己
- struct device_driver {