POJ 3176 Cow Bowling

#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;
}