POJ-3176 Cow Bowling

Posted 2020-12-31 wpbing

Language: Default Cow Bowling Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 22568   Accepted: 14886 Description The cows don‘t use actual bowling balls when they go bowling. They each take a number (in the range 0..99), though, and line up in a standard bowling-pin-like triangle like this:  7 3 8 8 1 0 2 7 4 4 4 5 2 6 5 Then the other cows traverse the triangle starting from its tip and moving "down" to one of the two diagonally adjacent cows until the "bottom" row is reached. The cow‘s score is the sum of the numbers of the cows visited along the way. The cow with the highest score wins that frame.  Given a triangle with N (1 <= N <= 350) rows, determine the highest possible sum achievable. Input Line 1: A single integer, N  Lines 2..N+1: Line i+1 contains i space-separated integers that represent row i of the triangle. Output Line 1: The largest sum achievable using the traversal rules Sample Input 5 7 3 8 8 1 0 2 7 4 4 4 5 2 6 5 Sample Output 30 Hint Explanation of the sample:  7 * 3 8 * 8 1 0 * 2 7 4 4 * 4 5 2 6 5 The highest score is achievable by traversing the cows as shown above.

//递推一下就好了，想一下这一步是怎么来的就出来递推式了
#include<stdio.h>
#include<algorithm>
#include<iostream>
using namespace std;
int n,map[1000][1000],dp[1000][1000];
int ans=0;

int main()
{
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=i;j++)
        {
            cin>>map[i][j];
        }
    }
    int i,j;
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=i;j++)
        {
            dp[i][j]=max(dp[i-1][j],dp[i-1][j-1])+map[i][j];
            ans=max(ans,dp[i][j]);
        }
        
    }
    cout<<ans;
}