hdu 2084 数塔（水题，dp）

直接上码

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
#include <map>
#include <set>
#include <vector>
#include <stack>
#include <algorithm>

using namespace std;

#define mst(a,b) memset(a,b,sizeof(a))
#define eps 10e-8

const int MAX_ = 10010;
const int N = 100010;
const int INF = 0x7fffffff;

int a[2][MAX_], dp[MAX_];


int main(){
	int n, s, t, mmax, T, k;
	scanf("%d",&T);
	while(T--){
	    scanf("%d",&n);
	    memset(a,0,sizeof(a));
	    s = 0;
	    for(int i = 1; i <= n; ++i){
            for(int j = 1; j <= i; ++j){
                scanf("%d",&k);
                a[s][j] = max(a[s^1][j],a[s^1][j-1]) + k;
            }
            s^=1;
	    }
	    mmax = -INF;
        for(int i = 1; i <= n; ++i){
            mmax = max(mmax, a[s^1][i]);
        }

        printf("%d\n",mmax);
	}
	return 0;
}