各种动态规划

1、01背包问题（类似兑奖获得最大价值、挖金矿）

      假设有m张奖券，要兑换n个礼物，已知每个奖品所需要的奖券数和价值，求如何兑换获得的价值最大，实现代码如下所示：

//5 1000              //奖品数和奖券数      相当于物体个数和总体积  金矿个数和总人数
//144 990             //消耗的奖券数和价值  相当于单个体积和重量    单个金矿所需人数和价值
//487 436
//210 673
//567 58
//1056 897
#include <iostream>
using namespace std;
int max(int x, int y)
{
	return (x > y) ? x : y;
}
int main()
{
	int n;//奖品数
	int m;//奖券数
	int *need;
	int *value;
	int **maxValue;
	cin >> n >> m;
	need = new int[n + 1];
	value = new int[n + 1];
	maxValue = new int*[n + 1];
	for (int i = 0; i <= n; i++)
	{
		maxValue[i] = new int[m + 1];
	}

	for (int i = 1; i <= n; i++)
		cin >> need[i] >> value[i];
	for (int j = 0; j <= m; j++)
	{
		maxValue[0][j] = 0;
	}
	for (int i = 1; i <= n; i++)
	{
		for (int j = 0; j <= m; j++)
		{
			//求j张奖券换取前i个奖品获得的最大值
			if (j < need[i])   //如果第i个奖品需要的奖券数大于j,则不能兑换第i个奖品
			{
				maxValue[i][j] = maxValue[i - 1][j];
			}
			else               //如果如果第i个奖品需要的奖券数小于等于j，则取不兑换
			{                  //第i个奖品与兑换第i个奖品获得的最大值得大者
				maxValue[i][j] = max(maxValue[i-1][j], maxValue[i-1][j - need[i]] + value[i]);
			}
			
		}
	}
	cout << maxValue[n][m] << endl;           //m个张奖券换取前n个奖品获得的最大价值
	delete[]need;
	delete[]value;
	for (int i = 0; i <= n; i++)
	{
		delete[]maxValue[i];
	}
	delete[]maxValue;
	return 0;
}

    上面的解法消耗n*m单位个内存，可以优化空间，只消耗m个存储单元，实现代码如下

#include <iostream>
using namespace std;
int max(int x, int y)
{
	return (x > y) ? x : y;
}
int main()
{
	int n;//奖品数
	int m;//奖券数
	int *need;
	int *value;
	int *maxValue;
	cin >> n >> m;
	need = new int[n+1];
	value = new int[n+1];
	maxValue = new int[m + 1];
	for (int i = 1; i<=n; i++)
		cin >> need[i] >> value[i];
	for (int j = 0; j <= m; j++)
	{
		maxValue[j] = 0;
	}
	for (int i = 1; i <= n; i++)
	{
		for (int j = m; j >=need[i]; j--)
		{
			maxValue[j] = max(maxValue[j], maxValue[j - need[i]] + value[i]);	
		}
	}
	cout << maxValue[m] << endl;
	delete []need;
	delete []value;
	delete []maxValue;
	return 0;
}

2、完全背包问题

    完全背包问题是01，背包问题的升级版，每种奖品的数量可以是多个，实现代码如下所示：

#include <iostream>
using namespace std;
int max(int x, int y)
{
	return (x > y) ? x : y;
}
int main()
{
	int n;//奖品数
	int m;//奖券数
	int *need;
	int *value;
	int **maxValue;
	cin >> n >> m;
	need = new int[n + 1];
	value = new int[n + 1];
	maxValue = new int*[n + 1];
	for (int i = 0; i <= n; i++)
	{
		maxValue[i] = new int[m + 1];
	}

	for (int i = 1; i <= n; i++)
		cin >> need[i] >> value[i];
	for (int j = 0; j <= m; j++)
	{
		maxValue[0][j] = 0;
	}
	for (int i = 1; i <= n; i++)
	{
		for (int j = 0; j <= m; j++)
		{
			maxValue[i][j]=0;
			for (int k = 0; k <= j / need[i];k++)
			{
				maxValue[i][j] = max(maxValue[i][j], maxValue[i - 1][j - need[i]*k] + value[i]*k);
			}
		}
	}
	cout << maxValue[n][m] << endl;
	delete[]need;
	delete[]value;
	for (int j = 0; j <= n; j++)
	{
		delete[]maxValue[j];
	}
	delete[]maxValue;
	return 0;
}

上述解法可以进行时间优化，实现代码如下所示：

#include <iostream>
using namespace std;
int max(int x, int y)
{
	return (x > y) ? x : y;
}
int main()
{
	int n;//奖品数
	int m;//奖券数
	int *need;
	int *value;
	int **maxValue;
	cin >> n >> m;
	need = new int[n + 1];
	value = new int[n + 1];
	maxValue = new int*[n + 1];
	for (int i = 0; i <= n; i++)
	{
		maxValue[i] = new int[m + 1];
	}

	for (int i = 1; i <= n; i++)
		cin >> need[i] >> value[i];
	for (int j = 0; j <= m; j++)
	{
		maxValue[0][j] = 0;
	}
	for (int i = 1; i <= n; i++)
	{
		for (int j = 0; j <= m; j++)
		{
			if (need[i] > j)
			{
				maxValue[i][j] = maxValue[i - 1][j];
			}
			else
			{
				maxValue[i][j] = max(maxValue[i - 1][j], maxValue[i][j - need[i]] + value[i]);
			}
		}
	}
	cout << maxValue[n][m] << endl;
	delete[]need;
	delete[]value;
	for (int j = 0; j <= n; j++)
	{
		delete[]maxValue[j];
	}
	delete[]maxValue;
	return 0;
}

3、最长不降子序列的长度

#include<iostream>
using namespace std;
int list(int *a,int n)
{
	int *d=new int[n];
	int max=1;
	for(int i=0;i<n;i++)
	{
		d[i]=1;
		for(int j=0;j<i;j++)
		{
			if(a[j]<=a[i]&&d[j]+1>d[i])
				d[i]=d[j]+1;
		}
		if(d[i]>max)
			max=d[i];
	}
	delete[]d;
	return max;
}
int main()
{
	int a[6] = { 1, 2, 3, 1, 1, 2 };
	cout << list(a, 6) << endl;
	return 0;

}

4、最大公共子串

#include<iostream>
#include<string>
using namespace std;
int main()
{
	string X, Y;
	int i = 0;
	int j = 0;
	int **dp = NULL;
	cin >> X >> Y;
	int xlen = X.size();
	int ylen = Y.size();
	dp = new int*[xlen + 1];
	for (i = 0; i <= xlen; i++)
	{
		dp[i] = new int[ylen + 1];
	}
	for (i = 0; i <= xlen; i++)
	{
		dp[i][0] = 0;
	}
	for (j = 0; j <= ylen; j++)
	{
		dp[0][j] = 0;
	}
	for (i = 1; i <= xlen; ++i)
	{
		for (j = 1; j <= ylen; ++j)
		{
			if (X[i - 1] == Y[j - 1])
			{
				dp[i][j] = dp[i - 1][j - 1] + 1;
			}
			else if (dp[i][j - 1] > dp[i - 1][j])
			{
				dp[i][j] = dp[i][j - 1];
			}
			else
			{
				dp[i][j] = dp[i - 1][j];
			}
		}
	}
	cout << "len of LCS is:" << dp[xlen][ylen] << endl;
	i = xlen;
	j = ylen;
	int k = dp[i][j];
	string buf;
	while (i && j)
	{
		if (X[i - 1] == Y[j - 1] && dp[i][j] == dp[i - 1][j - 1] + 1)
		{
			buf.insert(buf.begin(), X[i - 1]);
			--i; --j;
		}
		else if (dp[i - 1][j] > dp[i][j - 1])
		{
			--i;
		}
		else
		{
			--j;
		}
	}
	cout << buf << endl;
	return 0;
}