zoukankan      html  css  js  c++  java
  • 【POJ】[3176]Cow Bowling

    Cow Bowling

    Time Limit: 1000MS Memory Limit: 65536K
    Total Submissions: 17309 Accepted: 11558

    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.
    经典dp问题 从下面向上有 dp[i][j]+=max(dp[i+1][j],dp[i+1][j+1]) 所以最后结果就会是dp[0][0]
    #include<stdio.h>
    #include<algorithm>
    using namespace std;
    int map[352][352];
    int main() {
        int n;
        while(scanf("%d",&n)!=EOF) {
            for(int i=0; i<n; i++)
                for(int j=0; j<=i; j++)
                    scanf("%d",&map[i][j]);
            if(n==1) {
                printf("%d
    ",map[0][0]);
                continue;
            }
            for(int i=n-2; i>=0; i--) {
                for(int j=0; j<=i; j++) {
                    map[i][j]+=max(map[i+1][j],map[i+1][j+1]);
                }
            }
            printf("%d
    ",map[0][0]);
        }
        return 0;
    }
    题目地址:【POJ】[3176]Cow Bowling

    查看原文:http://www.boiltask.com/blog/?p=1447
  • 相关阅读:
    git版本回退:git reset --hard 版本号
    cheerio中文文档
    疫情实时大数据报告(利用nodejs)
    Package.json 属性说明
    11 个Chrome骚技巧让你为所欲为
    vue刷新页面空白分两种情况
    修改i输入框中placeholder的样式
    input输入框显示不全是用省略号...代替
    PC端适应屏幕分辨率
    CSS设置滚动条样式
  • 原文地址:https://www.cnblogs.com/BoilTask/p/12569464.html
Copyright © 2011-2022 走看看