【动态规划】经典例题

#include

using namespace std;

void feibonaqi()//斐波那契数列
{

int n;

cin >> n;

int bp[100];

bp[1] = bp[2] = 1;

for (int i = 3; i <=n; i++)
{
	bp[i] = bp[i - 1] + bp[i - 2];
}

cout << bp[n] << endl;

}

void maxsum()//最大子序和
{

int a[7] = { 5,3,4,-1,9,-80,7 };

int bp[7];

int max = a[0];

bp[0] = a[0];

for (int i = 1; i < 7; i++)
{
	bp[i] = (bp[i - 1] + a[i] > a[i] ? bp[i - 1] + a[i] : a[i]);
	if (bp[i] > max)
	{
		max = bp[i];
	}
}

for (int i = 0; i < 7; i++)
{
	cout << bp[i] << endl;
}

cout << max << endl;

}

void maxzulen()//最大子序长
{
int a[7] = { 5,3,4,-1,9,-80,7 };

int len[7];

len[0] = 1;

int max = 1;

for (int i = 1; i < 7; i++)
{
	if (a[i] > a[i - 1])
	{
		len[i] = len[i - 1] + 1;
	}
	else
	{
		len[i] = 1;
	}

	if (len[i] > max)
	{
		max = len[i];
	}
}

cout << max << endl;

}

void maxtolen()//最大公共子序和
{
int a[7] = { 5,3,4,-1,9,-80,7 };

int b[7] = { 7,6,4,-1,9,-80,8 };

int len[7][7];

for (int i = 0; i < 7; i++)
{
	len[i][0] = 0;
	len[0][i] = 0;
}

int max = 0;

for (int i = 1; i < 7; i++)
{
	for (int j = 1; j < 7; j++)
	{
		if (a[i-1] == b[j-1])
				len[i][j] = len[i - 1][j - 1] + 1;
		else
			len[i][j] = (len[i - 1][j] > len[i][j-1] ? len[i - 1][j] : len[i][j - 1]);

		if (len[i][j] > max)
		{
			max = len[i][j];
		}
	}
}

cout << max << endl;

}

int main()
{

}