18.합이 최대가 되는 경로(오래걸림).cpp

#include<stdio.h>
#include<Windows.h>

int main()
{
	int array[16][16] = {
		{75}, //(0,0)
		{95, 64},
		{17, 47, 82},
		{18, 35, 87, 10},
		{20,  4, 82, 47, 65},
		{19,  1, 23, 75,  3, 34},
		{88,  2, 77, 73,  7, 63, 67},
		{99, 65,  4, 28,  6, 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,  4, 68, 89, 53, 67, 30, 73, 16, 69, 87, 40, 31},
		{ 4, 62, 98, 27, 23,  9, 70, 98, 73, 93, 38, 53, 60,  4, 23} // (14,0)~(14,14)
	};

	int i, j, max = 0;
	for (i = 1; i <= 14; i++)
	{
		for (j = 0; j <= i; j++)
		{
			if (j == 0)
			{
				array[i][j] += array[i - 1][j];
			}
			else if (j == i)
			{
				array[i][j] += array[i - 1][j - 1];
			}
			else
			{
				array[i][j] += array[i - 1][j - 1] >= array[i - 1][j] ? array[i - 1][j - 1] : array[i - 1][j];
			}

			if (i == 14)
				if (max <= array[i][j])
					max = array[i][j];
		}
	}
	printf("ÃÖ´ñ°ªÀº %d ÀÔ´Ï´Ù.", max);

	return 0;
}