Poj 3176 cow Bowling

Question link: http://poj.org/problem? Id = 3176

 

Idea: dynamic question. DP [I] [J] indicates that the maximum value of the J is selected for the I line;

State transition equation: DP [I] [J] = max (DP [I-1] [J-1] + A [I] [J], DP [I-1] [J] + A [I] [J]) where a [I] [J] represents the value of column J in row I.

 

Code:

#include <iostream>#include <cstring>using namespace std;int dp[351][351];int a[351][351];int main(){    int n;    int res;    while(cin>>n)    {        memset(dp,0,sizeof(dp));        res = 0;                for(int i = 1;i<=n;i++)        {            for(int j=1;j<=i;j++)            {                cin>>a[i][j];                dp[i][j] = max(dp[i-1][j]+a[i][j],dp[i-1][j-1]+a[i][j]);            }        }        for(int i=1;i<=n;i++)        {            res = res<dp[n][i]?dp[n][i]:res;        }        cout<<res<<endl;    }    return 0;}