zoukankan      html  css  js  c++  java
  • Cow Bowling POJ

    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[ i ][ j ]表示在(i,j)位置时的最大值。
    所以:dp[i][j]=max(dp[i+1][j]+map[i+1][j],dp[i+1][j+1]+map[i+1][j+1]);
     1 #include<cstdio>
     2 #include<cstring>
     3 #include<iostream>
     4 #include<algorithm>
     5 using namespace std;
     6 
     7 int n;
     8 int map[400][400],dp[400][400];
     9 
    10 void solve()
    11 {   int ans=0;
    12     for(int i=n-2;i>=0;i--)
    13         for(int j=0;j<=i;j++)
    14             dp[i][j]=max(dp[i+1][j]+map[i+1][j],dp[i+1][j+1]+map[i+1][j+1]);
    15     ans=dp[0][0]+map[0][0];
    16     cout<<ans<<endl;
    17 }
    18 
    19 int main()
    20 {   cin>>n;
    21     for(int i=0;i<n;i++)
    22         for(int j=0;j<i+1;j++)
    23             scanf("%d",&map[i][j]);
    24     memset(dp,0,sizeof(dp));        
    25     
    26     solve();
    27 }
     
  • 相关阅读:
    运行VCK190的A72的Linux
    【分享】MPSoC UBoot下SD/eMMC卡的验证
    【分享】在MPSoC上运行基于eglfs_kms的QT应用程序
    大数据运维(67)pytorch安装及基本使用(win10+CPU+Python3.6)
    大数据运维(66)PyTorch GPU环境配置及安装
    Java多线程学习-AQS
    Java多线程学习:(wait,notify)--(await,signal)--(park,unpark)
    LeetCode52. N皇后 II
    LeetCode51. N 皇后
    LeetCode417. 太平洋大西洋水流问题
  • 原文地址:https://www.cnblogs.com/zgglj-com/p/7287310.html
Copyright © 2011-2022 走看看