[HNUOJ 10014] The Triangle

The Triangle

Time Limit: 1000ms, Special Time Limit:2000ms, Memory Limit:32768KB

Total submit users: 2021, Accepted users: 1503

Problem 10014 : No special judgement

Problem description

7 3 8 8 1 0 2 7 4 4 4 5 2 6 5 (Figure 1) Figure 1 shows a number triangle. Write a program that calculates the highest sum of numbers passed on a route that starts at the top and ends somewhere on the base. Each step can go either diagonally down to the left or diagonally down to the right.

Input

Your program is to read from standard input. The first line contains one integer T, the number of test cases, for each test case: the first line contain a integer N: the number of rows in the triangle. The following N lines describe the data of the triangle. The number of rows in the triangle is > 1 but <= 100. The numbers in the triangle, all integers, are between 0 and 99.

Output

Your program is to write to standard output. The highest sum is written as an integer for each test case one line.

Sample Input

1 5 7 3 8 8 1 0 2 7 4 4 4 5 2 6 5

Sample Output

30

Problem Source

IOI 1994

AC:

#define _CRT_SECURE_NO_WARNINGS
#include<cstdio>
#include<cstring> 
#include<cstdlib>
#include <queue>

const int MAX_N = 105;

int dp[MAX_N][MAX_N];
int a[MAX_N][MAX_N];

int find(int i, int j, int n)
{
    if (i == n - 1) return dp[i][j] = a[i][j];
    return dp[i][j] != -1 ? dp[i][j] : dp[i][j] = a[i][j] + std::max(find(i+1, j + 1, n), find(i+1, j, n));
}

int main()
{
    int n, t;
    scanf("%d", &t);
    for (int times = 0; times < t; ++times)
    {
        memset(dp, -1, sizeof(dp));
        memset(a, 0, sizeof(a));
        scanf("%d", &n);
        for (int i = 0; i < n; ++i)
        {
            for (int j = 0; j < i + 1; ++j)
            {
                scanf("%d", &a[i][j]);
            }
        }
        printf("%d\n", find(0, 0, n));
    }
    
    return 0;
}