problem 18 数塔问题

简单dp

#include <iostream>
#include <cstdio>
using namespace std;
int main()
{
	int num[20][25] = {{75},{95, 64},{17,47,82},{18,35,87,10},{	20,04,82,47,65},{	19,01,23,75,03,34},{	88,02,77,73,07,63,67},{	99,65,04,28,06,16,70,92},{	41,41,26,56,83,40,80,70,33},{	41,48,72,33,47,32,37,16,94,29},{	53,71,44,65,25,43,91,52,97,51,14},{	70,11,33,28,77,73,17,78,39,68,17,57},{	91,71,52,38,17,14,91,43,58,50,27,29,48},{	63,66,04,68,89,53,67,30,73,16,69,87,40,31},{	04,62,98,27,23,9,70,98,73,93,38,53,60,04,23}};
	int i,j;
	for(i = 13; i >= 0; i--)
	{
		for(j = 0; j < 20; j++)
		{
			if(num[i + 1][j] > num[i + 1][j + 1])
			{
				num[i][j] += num[i + 1][j];
			}
			else
			{
				num[i][j] += num[i +1][j + 1];
			}


		}
	}
	printf("%d\n",num[0][0]);
		return 0;
}


你可能感兴趣的:(problem 18 数塔问题)