Dynamic Programming

1、最长公共子序列

2、0-1背包（O(n*w)）

（每个物体只能用一次）
背包体积为w，n个物体体积、价值分别为wi，vi
B(i,w)表示前0~i个物体在背包体积为w的限制下的最大价值

空间优化：

观察状态转移方程可以知道，第i 件物品的状态仅与第 i-1 件物品的状态有关，因此可以将 dp 定义为一维数组：

dp[w] = max(dp[w], dp[w-wi]+vi)

因为dp[w-wi]表示dp[i-1][w-wi],因此不能先求 dp[i][w-wi]，以防将dp[i-1][j-w] 覆盖（如果从左到右遍历，基于上一趟的dp[i-1][]，这一趟dp[i][]则从左至右覆盖dp[i-1][]，则无法求解dp[i][w]=dp[i-1][w-wi]+vi）
即要先计算 dp[i][j] 再计算 dp[i][j-w]，在程序实现时需要按倒序来循环求解。

3、背包问题的变种（物体可重复使用O(n*w)）

// 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()];
}
//optimize 0-1 package by roll array
//背包体积为W，物品个数为n
int optimize_knapsack(int W, int n, int[] weights, int[] values) {
    int[] dp = new int[n + 1];
    for (int i = 1; i <= n; i++) {
        int w = weights[i - 1], v = values[i - 1];
        for (int j = W; j >= 1; j--) 
            if (w <= j)
                dp[j] = max(dp[j], dp[j - w] + v);
    }
    return dp[W];
}
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;
}