[백준] 실버1 : (1932) 정수 삼각형

https://www.acmicpc.net/problem/1932

1932번: 정수 삼각형

 

#include <iostream>
#include <vector>
#include <cstring>
using namespace std;

int N, Cnt = 1, Answer;
int Cache[501][501], Tri[501][501];

int Func(int y, int x)
{
    if (y == N - 1) return Tri[y][x];

    int& Ref = Cache[y][x];
    if (Ref != -1) return Ref;

    return Ref = Tri[y][x] + max(Func(y + 1, x), Func(y + 1, x + 1));
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    cin >> N;

    memset(Cache, -1, sizeof(Tri));
    for (int i = 0; i < N; ++i)
    {
        for (int j = 0; j < Cnt; ++j)
            cin >> Tri[i][j];
        Cnt++;
    }

    Answer = Func(0, 0);
    cout << Answer << "\n";
}