poj 1163 The Triangle

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int M = 110;

int a[M][M];
int dp[M][M];  //dp[i][j]表示从下到上dp到第i行，第j列的最大的值
int n;
int solve()
{
    for(int i = 1; i <= n; i++)
     dp
[i] = a
[i];
     for(int i = n; i > 1; i--)
     {
         for(int j = 1; j <= i; j++)
         if(dp[i][j]  > dp[i][j+1]) //如果左边比右边大
         {
             dp[i-1][j] = dp[i][j] + a[i-1][j];  //dp[i-1][j] = 左边+a[i-1][j]。记住是从下到上啊
         }
         else  
         {
             dp[i-1][j] = dp[i][j+1] + a[i-1][j];
         }
     }
     return dp[1][1];
}
int main()
{

   cin >> n;
   for(int i = 1; i <= n; i ++)
      for(int j = 1; j <= i; j++)
      cin >> a[i][j];

      int ans = solve();
      cout << ans << endl;
    return 0;
}