2020-10-12

动态规划 poj 1163 The Triangle

简单动态规划求解

```cpp
#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
#define N 100
int n;
int tes[N][N],ans[N][N];
int dp(int i,int j){
        if(ans[i][j]!=-1)return ans[i][j];
        if(i==n){
                        ans[i][j]=tes[i][j];
                        return tes[i][j];
        }
                        ans[i][j]=max(dp(i+1,j),dp(i+1,j+1))+tes[i][j];
                        return ans[i][j];
}
int main(){
        scanf("%d",&n);
        for(int i=1;i<=n;i++)
                for(int j=1;j<=i;j++){
                        scanf("%d",&tes[i][j]);
                        ans[i][j]=-1;
                }
        printf("%d\n",dp(1,1));
        return 0;
}