USACO1.6 Number Triangles [dp-简单dp]

题目传送门

 回忆童年

 

/*
ID: Starry21
LANG: C++
TASK: ariprog                 
*/  
#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<algorithm>
using namespace std;
#define N 1005
#define ll long long
#define INF 0x3f3f3f3f
int a[N][N],dp[N][N];
int n;
int main() 
{
    //freopen("ariprog.in","r",stdin);
    //freopen("ariprog.out","w",stdout);
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
        for(int j=1;j<=i;j++)
        {
            scanf("%d",&a[i][j]);
            dp[i][j]=a[i][j];
        }
    for(int i=n-1;i>=1;i--)
        for(int j=1;j<=i;j++)
            dp[i][j]=max(dp[i+1][j],dp[i+1][j+1])+a[i][j];
    printf("%d\n",dp[1][1]);
    return 0;
}