http://projecteuler.net/problem=18 [Answer:1074]

#include <iostream>
#include <algorithm>

using namespace std;

int main()
{
    const int N = 15;
    int x[N][N];
    int sum[N][N];

    cin >> x[0][0];
    sum[0][0] = x[0][0];
    for ( int i = 1; i < N; ++i )
    {
        for ( int j = 0; j <= i; ++j )
        {
            cin >> x[i][j];
        }
        sum[i][0] = sum[i-1][0] + x[i][0];
        sum[i][i] = sum[i-1][i-1] + x[i][i];
        for ( int j = 1; j < i; ++j )
        {
            sum[i][j] = max( sum[i-1][j-1], sum[i-1][j] ) + x[i][j];
        }
    }

    int maximum = 0;
    for ( int i = 0; i < N; ++i )
    {
        if ( sum[N-1][i] > maximum )
        {
            maximum = sum[N-1][i];
        }
    }

    cout << maximum << endl;
    return 0;
}