poj 1157 LITTLE SHOP OF FLOWERS 动态规划
摘要：
//dp[i][j]表示前i个花瓶装前j束花的最大审美值//dp[i][j] = max(dp[i-1][j], dp[i-1][j-1]+cost[j][i])#include<iostream>using namespace std;const int INF = 1000000000;const int N = 105;int dp[N][N];int cost[N][N];int f, n... 阅读全文
posted @ 2011-03-31 23:55 sysuwhj 阅读(357) 评论(0) 推荐(0) 编辑