POJ 3176 Cow Bowling (DP)

Cow Bowling

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 14748		Accepted: 9804

Description

The cows don ' t use actual bowling balls when they go bowling. They 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 one, diagonally adjacent co WS until the "bottom" row is reached. The cow's score is the sum of the numbers of the cows visited along the. The cow with the highest score wins that frame.

Given a triangle with n (1 <= n <=) 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

573 88 1 02 7 4 44 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.

Source

#include <stdio.h>#include<string.h>#include<algorithm>using namespacestd;#defineMAXN 351intDP[MAXN][MAXN];intA[MAXN][MAXN];intN;voidsolve () { for(inti=n-1; i>=0; i--)    {         for(intj=0; j<=i;j++) {Dp[i][j]=max (dp[i+1][j],dp[i+1][j+1])+A[i][j]; }} printf ("%d\n", dp[0][0]);}intMain () { while(SCANF ("%d", &n)! =EOF) {         for(intI=0; i<n;i++)        {             for(intj=0; j<=i;j++) {scanf ("%d",&A[i][j]); }} memset (DP,0,sizeof(DP));    Solve (); }    return 0;}

POJ 3176 Cow Bowling (DP)