Cow+Bowling

PKU ID: 3176 - Cow Bowling
Time Limit:1000MS Memory Limit:65536K

Total Submit:702 Accepted:481

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.

해석
소가 볼링을 치고있답니다. 그런데 각핀에는

점수가 있습니다. 핀을 치는데 한라인당 하나의 핀을 쓰러뜨릴 수 있습니다. 아래까지 내려오면서 가장 큰 점수를 낼 수 있는 핀들을 쓰려뜨려서

가장 큰 점수를 얻어야 합니다. 핀을 쓰러뜨리고 아래줄의 핀을 쓰러뜨릴때는 위에쓰러진 핀의 대각전 아래에 있는 핀들만 쓰러뜨릴 수 있습니다.

출처
[]

Source Code code format="java" public class CowBowling{ public static void main(String[] args){ int pins[][] = {{7}, {3, 8}, {8, 1, 0}, {2, 7, 4, 4}, {4, 5, 2, 6, 5}};

int row = pins.length - 1; for(int i = 0; i < row; i++){ int col = pins[row - i].length - 1; for(int j = 0; j < col; j++){ pins[row - i - 1][j] += max(pins[row - i][j], pins[row - i][j + 1]); } }

System.out.println(pins[0][0]); }

public static int max(int a, int b){ if(a > b){ return a; }else{ return b; } } } code

Comment