zoukankan      html  css  js  c++  java
  • POJ3176——DP——Cow Bowling

    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

    大意:每一行只能选取一个,满足树型, 连起来最长多少,经典DP

    #include<cstdio>
    #include<cstring>
    #include<algorithm>
    using namespace std;
    const int MAX = 400;
    int a[MAX][MAX];
    int main()
    {
       int n;
       scanf("%d",&n);
       for(int i = 1; i <= n ;i++)
         for(int j = 1; j <= i ;j++)
           scanf("%d",&a[i][j]);
       for(int i = 1 ; i <= n; i++){
            for(int j = 1; j<= i;j++){
              a[i][j] +=  max(a[i-1][j],a[i-1][j-1]);
            }
       }
    int max1 = 0;
       for(int i = 1 ; i <= n ;i++)
       max1 = max(max1,a[n][i]);
       printf("%d
    ",max1);
      return 0;
    }
    View Code
  • 相关阅读:
    setoptsocket函数
    C++右值引用
    const char* char const* char*const
    select()函数以及FD_ZERO、FD_SET、FD_CLR、FD_ISSET
    gitee搭建应用
    C++ 实现基本运算+-*/
    C++学习笔记(一)mutable function
    创造型设计模式-----抽象工厂模式
    openPhase gcc迁移
    SQLPLUS 远程连接数据库
  • 原文地址:https://www.cnblogs.com/zero-begin/p/4366228.html
Copyright © 2011-2022 走看看