HDU 2084 数塔（DP）

题目链接：Click here

开始看DP，这里面水好深啊。最简单的DP，感觉自下而上是比较方便的，循环判断完就可以输出，自上而下的还要再判断最后一层的最大值。

状态转移方程：dp[i][j] = tower[i][j] + max(dp[i+1][j], dp[i+1][j+1]);

#include <iostream>#include <cstring>#include <cstdio>#include <queue>#include <cstdlib>using namespace std;int tower[105][105];int dp[105][105];int main(){    int n, s;    scanf("%d", &s);    while(s--)    {        scanf("%d", &n);        memset(tower, 0, sizeof(tower));        memset(dp, 0, sizeof(dp));        for(int i = 1; i <= n; i++)            for(int j = 1; j <= i; j++)            scanf("%d", &tower[i][j]);        for(int i = n; i >0; i--)            for(int j = 1; j <= i; j++)                dp[i][j] = tower[i][j] + max(dp[i+1][j], dp[i+1][j+1]);        printf("%d\n", dp[1][1]);    }    return 0;}