3176.txt

北大ACM题目例程 详细的解答过程 程序实现 算法分析

Source

Problem Id:3176  User Id:fzk 
Memory:540K  Time:15MS
Language:C++  Result:Accepted

Source 

#include <stdio.h>
#include <math.h>

int ans[350][350];

int main( ) {
	int n, i, j;
	scanf( "%d", &n );
	for( i=0; i<n; i++ )
		for( j=0; j<=i; j++ )
			scanf( "%d", &ans[i][j] );

	for( i=n-2; i>=0; i-- ) {
		for( j=0; j<=i; j++ )
			if( ans[i+1][j+1] > ans[i+1][j] )
				ans[i][j] += ans[i+1][j+1];
			else
				ans[i][j] += ans[i+1][j];
	}
	printf( "%d\n", ans[0][0] );
	return 0;
}