POJ 1163 The Triangle [DP]

http://poj.org/problem?id=1163
数字三角形
经典动态规划

#include <cstdio>#include <iostream>using namespace std;int n;const int MAXN = 100;int dp[MAXN][MAXN];void solve(){  for (int i = 0; i < n; i++) {    for (int j = 0; j <= i; j++) {      scanf("%d", &dp[i][j]);    }  }  int ans = 0;  for (int i = 1; i < n; i++) {    dp[i][0] += dp[i - 1][0];    for (int j = 1; j <= i; j++) {      dp[i][j] += max(dp[i - 1][j - 1], dp[i - 1][j]);      ans = max(ans, dp[i][j]);    }  }  printf("%d\n", ans);}int main(){ // freopen("in.txt", "r", stdin);  while (scanf("%d", &n) != EOF) {    solve();  }}