最长递增子序列问题
给定一个整数数组,设计一个动态规划算法求出该数组中的最长递增子序列。
矩阵连乘问题
给定n个矩阵{A1,A2,…,An},其中AiAi+1是可乘的,i=1,2,…,n-1,考察这n个矩阵的连乘积A1A2…An,设计一个动态规划算法,求出这个矩阵连乘积问题的最优计算顺序。
实现要求:随机生成n个合法的可连乘的矩阵,以完全加括号的方式输出其最优计算顺序。
// Dynamic_expm6.cpp : 定义控制台应用程序的入口点。
//
#include "stdafx.h"
#include <iostream>
#include <string>
#include <algorithm>
#include <map>
#include "stdlib.h"
using namespace std;
//longest sub_sequence
int** co_subsequence(string a,string b)
{
int **co;
co = (int**)malloc(sizeof(int)*(b.length() + 1));
for (int i = 0; i <= b.length(); ++i) {
co[i] = (int*)malloc(sizeof(int)*(a.length()) + 1);
/* co[i] = { 0 }; //error!! */
for (int j = 0; j <= a.length(); ++j)
co[i][j] = 0;
}
for (int i = 1; i <= b.length(); ++i) {
for (int j = 1; j <= a.length(); ++j)
co[i][j] = max(max(co[i - 1][j], co[i][j - 1]), co[i - 1][j - 1] + ((a[j - 1] == b[i - 1]) ? 1 : 0));
}
/** check the array we get
for (int i = 0; i <= b.length(); ++i) {
for (int j = 0; j <= a.length(); ++j)
cout << co[i][j];
cout << endl;
}
*/
return co;
}
void getsubsequence(string a,string b)
{
int **co = co_subsequence(a, b);
string s;
int i = b.length(),j = a.length();
while (i > 0 && j > 0) {
if (co[i][j] == co[i - 1][j])
i--;
else if (co[i][j] == co[i][j - 1])
j--;
else if (co[i][j] == co[i - 1][j - 1] + 1) {
s = a[j - 1] + s;
i--; j--;
}
}
cout << s << endl;
}
//---------------------------
//optimize longest sub_sequence by roll array
int long_subsequence(string a, string b)
{
if (a.length() < b.length())
{
string tmp = a;
a = b;
b = tmp;
}
//a is longer than b
int *co[2];
for (int i = 0; i <=1; ++i) {
co[i] = (int*)malloc(sizeof(int)*(b.length()) + 1);
/* co[i] = { 0 }; //error!! */
for (int j = 0; j <= b.length(); ++j)
co[i][j] = 0;
}
int e = 1;
for (int j = 0; j < a.length(); ++j) {
for (int i = 1; i <= b.length(); ++i)
co[e][i] = max(max(co[1 - e][i], co[e][i - 1]), co[1 - e][i - 1] + ((a[j] == b[i - 1]) ? 1 : 0));
e = 1 - e;
}
return co[1 - e][b.length()];
}
//-------------------------------
//0-1 package
int get_maxvalue(int w,map<int,int> m)
{
int **dp;
dp = (int**)malloc(sizeof(int)*(w + 1));
for (int i = 0; i <= w; ++i) {
dp[i] = (int*)malloc(sizeof(int)*(m.size()+1));
for (int j = 0; j <= m.size(); ++j)
dp[i][j] = 0;
}
for (int i = 1; i <= w; ++i)
{
for (int j = 1; j <= m.size() / 2; ++j)
if (dp[i - m[j - 1]] >= 0)
dp[i][j] = max(dp[i - m[j - 1]][j - 1] + m.find(j - 1)->second, dp[i][j - 1]);
/***map m[0] does not mean first key,this problem can be solved by two array, sort is needless****/
else
dp[i][j] = dp[i][j - 1];
}
for (int i = 0; i <= w; ++i) {
for (int j = 0; j <= m.size()/2; ++j)
cout << dp[i][j] << " ";
cout << endl;
}
return dp[w][m.size()];
}
int main()
{
string a = "acle";
string b = "barecl";
/*getsubsequence(a, b);
cout << long_subsequence(a, b) << endl;*/
map<int, int> m;
m.insert(pair<int, int>(6, 30));
m.insert(pair<int, int>(3, 14));
m.insert(pair<int, int>(4, 16));
m.insert(pair<int, int>(2, 9));
//sort m by weight,automaticly
for (auto i = m.begin(); i != m.end(); i++)
cout << i->first << "->" << i->second << endl;
int max_value = get_maxvalue(10, m);
cout << max_value<< endl;
return 0;
}