HDU2084-数塔

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<stdlib.h>
#include <math.h>
#define N 105
using namespace std;
int height,tree[N][N],dp[N][N];

int main(){
    int testcase;
    scanf("%d",&testcase);
    while ( testcase-- ){
        scanf("%d",&height);
        memset(dp,0,sizeof(dp));
        for( int i=0;i<height;i++ ){
            for( int j=0;j<i+1;j++ ){
                scanf("%d",&tree[i][j]);
            }
        }
        for( int i=height-1;i>=0;i-- ){
            for( int j=0;j<i+1;j++ ){
                dp[i][j]=tree[i][j]+max(dp[i+1][j],dp[i+1][j+1]);
            }
        }
        printf("%d\n",dp[0][0]);
    }
    system("pause");
    return 0;
}