POJ-1163 The Triangle

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;

int main(void)
{
    int num[110][110], dp[110][110];
    int n;
    
    memset(dp, -1, sizeof(dp));
    cin >> n;
    for(int i = 0; i < n; i++)    {
        for(int j = 0; j <= i; j++)    {
            scanf("%d", &num[i][j]);
            if(i == n-1)
                dp[i][j] = num[i][j];
        }
    }
    
    for(int i = n-2; i >= 0; i--)   {
        for(int j = 0; j <= i; j++)    {
            dp[i][j] = max(dp[i+1][j]+num[i][j], dp[i+1][j+1]+num[i][j]);
            
        }
    }
    
    cout << dp[0][0] << endl;
    
    return 0;
}