USACO 1.5 Number Triangles (DP动态规划)

#include <stdio.h>
#define DEBUG 1
#define TESTCASES 9
#define MAX 1000
#define BIGGER(x, y) ( (x) > (y) ? (x) : (y) )

int numOfRows;
int triangle[MAX + 1][MAX + 1];

int main(){
#if DEBUG
	int testCase;
	for (testCase = 1; testCase <= TESTCASES; testCase++){
		char inputFileName[20] = "inputx.txt";
		inputFileName[5] = '1' +  (testCase - 1);
		freopen(inputFileName, "r", stdin);
		printf("\n#%d\n", testCase);
#endif
	
	scanf("%d", &numOfRows);
	int result = 0;
	int row, column;
	for (row = 1; row <= numOfRows; row++)
		for (column = 1; column <= row; column++){
			scanf("%d", &triangle[row][column]);
			if (column == 1)
				triangle[row][column] = triangle[row - 1][column] + triangle[row][column];
			else 
				triangle[row][column] = BIGGER(triangle[row - 1][column], triangle[row - 1][column - 1]) + triangle[row][column];
			if (triangle[row][column] > result)
				result = triangle[row][column];
		}
	printf("%d\n", result);

#if DEBUG
	}
#endif
	return 0;
}