POJ 3176 Cow Bowling

http://poj.org/problem?id=3176

定义dp[i][j] 到这个点 能取得的最大值

转移方程 

 dp[i][j] = court[i][j] + max(dp[i-1][j-1], dp[i-1][j]);

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithm>

using namespace std;

int n;
int court[355][355], dp[355][355];
bool OK(int x, int y, int n)
{
    if (x < 0 || x > n || y < 0 || y > n) return false;
    return true;
}

//定义dp[i][j] 到达(i, j)这个点 所能取得的最大值
int main()
{
    freopen("in.txt", "r", stdin);
    scanf("%d", &n);
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j <= i; j++)
        {
            scanf("%d", &court[i][j]);
        }
    }
    memset(dp, 0, sizeof(dp));
    dp[0][0] = court[0][0];
    for (int i = 1; i < n; i++)
    {
        for (int j = 0; j <= i; j++)
        {
            if (j == 0) dp[i][j] = court[i][j] + dp[i-1][j];
            else if (j == i) dp[i][j] = court[i][j] + dp[i-1][j-1];
            else dp[i][j] = court[i][j] + max(dp[i-1][j-1], dp[i-1][j]);
        }
    }
    sort(dp[n-1], dp[n-1]+n);
    reverse(dp[n-1], dp[n-1]+n);
    cout << dp[n-1][0] << endl;
    return 0;
}