POJ-3176

最新推荐文章于 2019-06-12 11:59:00 发布

x_liushi_game

最新推荐文章于 2019-06-12 11:59:00 发布

阅读量370

点赞数

分类专栏： ACM之旅文章标签： traversal integer numbers output input each

本文链接：https://blog.csdn.net/x_liushi_game/article/details/7578209

版权

ACM之旅专栏收录该内容

69 篇文章 0 订阅

订阅专栏

Cow Bowling

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 10104		Accepted: 6642

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

Sample Output

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

USACO 2005 December Bronze

#include <stdio.h>

int num[65000], visit[65000];
int row;

int dp(int i, int r)
{
    int left, right;
    
    // 不能用0来判断是否访问过，因为有数据是0的 
    if (visit[i] != -1)
       return visit[i];
    if (r > row)
       return 0;
    left = dp(i+r, r+1);
    right = dp(i+r+1, r+1);
    if (left < right)
       left = right;
    visit[i] = num[i]+left;
    return visit[i];
}

int main()
{
    int i;
    scanf("%d", &row);
    memset(visit, -1, sizeof(visit));
    for (i = 0; scanf("%d", &num[i]) != EOF; i++)
        ;
    printf("%d\n", dp(0, 1)); 
    return 0;
}