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 }
     
  • 相关阅读:
    Android蓝牙通信 .[转]
    通过VS2010性能分析来查找代码中那些地方最损耗资源 [转]
    【百度地图API】如何区分地址解析和智能搜索?
    Windows 程序员必备的知识和工具
    NUnit详细使用方法
    Android 蓝牙开发浅析 [转]
    软件工程的国家标准下载链接
    android布局属性详解
    Android之Service相关
    Android 实现布局动态加载
  • 原文地址:https://www.cnblogs.com/zgglj-com/p/7287310.html
Copyright © 2011-2022 走看看