【hihoCoder】1037 : 数字三角形

5 //迷宫的层数
2
6 4
1 2 8
4 0 9 6
6 5 5 3 6
结果： 28
思路
动态规划
maze[i, j] = max(maze[i-1, j], maze[i-1, j-1])

源码

#include <iostream>
using namespace std;

int maze[100][100];
int data[100][100];
void dp(int level)
{
if (level < 0)
return;
dp(level - 1);
for (int room = 0; room <= level; room++)
{
if (level > 0)
{
if (room > 0)
maze[level][room] = maze[level - 1][room] > maze[level - 1][room - 1] ? maze[level - 1][room] : maze[level - 1][room - 1];
else
maze[level][room] = maze[level - 1][room];
}
else
maze[level][room] = 0;
maze[level][room] += data[level][room];
}
}
int main()
{
int maxLevel, i = 0, max = 0;
cin >> maxLevel;

for (i = 0; i < maxLevel; i++)
for (int j = 0; j <= i; j++)
cin >> data[i][j];
dp(maxLevel - 1);
for (i = 0; i < maxLevel; i++)
{
int tmp = maxLevel - 1;
if (max < maze[tmp][i])
max = maze[tmp][i];
}
cout << max << endl;
return 0;
}