代码
#include <iostream> #include <cstdio> #include <map> #include <cmath> #include <string.h> #include <algorithm> #include <set> #include <sstream> using namespace std; const int maxn = 0; const int INF = 0x3f3f3f3f; int main() { int a[110][110]; int f[110][110]; int c; while(scanf("%d",&c)!=EOF){ while(c--){ memset(f,0,sizeof(f)); int n; scanf("%d",&n); for(int i = 1;i<=n;++i){ for(int j = 1; j<=i;++j){ scanf("%d",&a[i][j]); } } f[1][1] = a[1][1]; for(int i = 2;i<=n;++i){///第一列只能由此列上一行走过来 f[i][1] = a[i][1]+f[i-1][1]; } for(int i = 2; i<=n;++i){///这里由于f初始全为0,并且>100所以可以向右越界 for(int j = 2; j<=i; ++j){ f[i][j] = max(f[i-1][j],f[i-1][j-1])+a[i][j]; } } int res = 0; for(int i =1;i<=n;++i){ res = max(res, f[n][i]); } printf("%d\n",res); } } return 0; }