1058.cpp

哈尔滨工业大学ACM 竞赛网上在线试题集锦的源代码

/*  This Code is Submitted by wywcgs for Problem 1058 on 2006-01-19 at 04:17:01 */ 
#include <cstdio>
#include <algorithm>
using namespace std;

const int MAX = 1024;

int main()
{
    int n, i, j;
    int tri[MAX][MAX];
    
    while(scanf("%d", &n) != EOF) {
        for(i = 0; i < n; i++)
			for(j = 0; j <= i; j++) scanf("%d", &tri[i][j]);
        for(i = n-1; i > 0; i--)
            for(j = 0; j < i; j++)
                tri[i-1][j] += max(tri[i][j],tri[i][j+1]);
        printf("%d\n", tri[0][0]);
    }

    return 0;
}