DP 简单题 之 poj 1163

#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int MAX_len = 102;
int dp[MAX_len][MAX_len];
int n;

int Solve()
{
for (int i=1; i<=n; i++) {
for (int j=1; j<=i; j++) {
dp[i][j] += max(dp[i-1][j-1], dp[i-1][j]);
//cout<<dp[i][j]<<'\t';
}
//cout<<endl;
}
int ans = 0;
for (int j=1; j<=n; j++)
ans = max(ans, dp
[j]);
return ans;
}

int main()
{
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
scanf("%d", &n);
memset(dp, 0, sizeof(dp));
for (int i=1; i<=n; i++) {
for (int j=1; j<=i; j++) {
scanf("%d", &dp[i][j]);
}
}
printf("%d", Solve());
return 0;
}