POJ 3176 Cow Bowling 动态规划

#include <iostream>
using namespace std;
int dp[357][357], N;
void input()
{
    scanf("%d", &N);
    for (int i = 1; i <= N; i++)
    {
        for (int j = 1; j <= i; j++)
        {
            scanf("%d", &dp[i][j]);
        }
    }
}
void solve()
{
    for (int i = 1; i <= N; i++)
    {
        for (int j = 1; j <= i; j++)
        {
            if (j == i)
            {
                dp[i][j] = dp[i][j] + dp[i - 1][j - 1];
            }
            else if (j == 1)
            {
                dp[i][j] = dp[i][j] + dp[i - 1][j];
            }
            else
            {
                dp[i][j] = dp[i][j] + max(dp[i - 1][j - 1], dp[i - 1][j]);
            }
        }
    }
}
int findAns()
{
    int ans = 0;
    for (int i = 1; i <= N; i++)
    {
        ans = max(ans, dp[N][i]);
    }
    return ans;
}
int main()
{
    input();
    solve();
    printf("%d\n", findAns());
    return 0;
}