洛谷 P1216 [USACO1.5] [IOI1994]数字三角形 Number Triangles(线性dp，一维优化）

题目链接：P1216 [USACO1.5] [IOI1994]数字三角形 Number Triangles - 洛谷 | 计算机科学教育新生态 (luogu.com.cn)

 

第一种写法

从上往下

#include <iostream>
#include <algorithm>

using namespace std;

const int N = 1010;

int r;
int g[N][N];
int f[N][N];

int main()
{
	cin >> r;
	for (int i = 1;i <= r;i++)
		for (int j = 1; j <= i; j++)
		{
			cin >> g[i][j];
		}
	for (int i = 1; i <= r; i++)
		for (int j = 1; j <= i; j++)
			f[i][j] = max(f[i - 1][j - 1] + g[i][j], f[i - 1][j] + g[i][j]);
		
	
	int res = 0;
	for (int i = 1; i <= r; i++)
		res = max(res, f[r][i]);
	cout << res << endl;
	return 0;
}

dp的第二种写法

从下向上‘归’

for (int i = r; i >= 1; i--)
    for (int j = 1; j <= i; j++)
       f[i][j] = max(f[i + 1][j], f[i + 1][j + 1]) + g[i][j];

cout << f[1][1] << endl;

#include <iostream>
#include <algorithm>

using namespace std;

const int N = 1010;

int r;
int g[N][N];
int f[N][N];

int main()
{
	cin >> r;
	for (int i = 1;i <= r;i++)
		for (int j = 1; j <= i; j++)
		{
			cin >> g[i][j];
		}
	for (int i = r; i >= 1; i--)
        for (int j = 1; j <= i; j++)
            f[i][j] = max(f[i + 1][j], f[i + 1][j + 1]) + g[i][j];

        cout << f[1][1] << endl;

	return 0;
}

一维优化

倒序，可以直接优化为一维

#include <iostream>
#include <algorithm>

using namespace std;

const int N = 1010;

int r;
int g[N][N];
int f[N];

int main()
{
	cin >> r;
	for (int i = 1;i <= r;i++)
		for (int j = 1; j <= i; j++)
		{
			cin >> g[i][j];
		}
	for (int i = r; i >= 1; i--)
        for (int j = 1; j <= i; j++)
            f[j] = max(f[j], f[j + 1]) + g[i][j];

        cout << f[1] << endl;

	return 0;
}