pku 3176 水

#include <iostream> #include <cstdio> #include <cstring> using namespace std; int map[351][351]; int dp[351][251]; int main() { int N; scanf("%d", &N); for(int i = 1; i <= N; ++i) for(int j = 1; j <= i; ++j) scanf("%d", &map[i][j]); memset(dp, 0, sizeof(dp)); dp[1][1] = map[1][1]; for(int i = 1; i <= N-1; ++i) for(int j = 1; j <= i; ++j) { if(dp[i][j] + map[i+1][j] > dp[i+1][j]) dp[i+1][j] = dp[i][j] + map[i+1][j]; if(dp[i][j] + map[i+1][j+1] > dp[i+1][j+1]) dp[i+1][j+1] = dp[i][j] + map[i+1][j+1]; } int Max = -1; for(int i = 1; i <= N; ++i) if(dp[N][i] > Max) Max = dp[N][i]; printf("%d/n", Max); return 0; }