zoukankan      html  css  js  c++  java
  • POJ-3176

    Cow Bowling
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 19864   Accepted: 13172

    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.

    题意:

    求金字塔顶到底的最大路线的值。

    从n-1行开始,每次取下一行的最大,知道顶端。

    AC代码:

     1 //#include<bits/stdc++.h>
     2 #include<iostream>
     3 #include<cmath>
     4 using namespace std;
     5 
     6 int dp[400][400];
     7 
     8 int main(){
     9     ios::sync_with_stdio(false);
    10     int n;
    11     while(cin>>n&&n){
    12         for(int i=1;i<=n;i++){
    13             for(int j=1;j<=i;j++){
    14                 cin>>dp[i][j];
    15             }
    16         }
    17         for(int i=n-1;i>=1;i--){
    18             for(int j=1;j<=i;j++){
    19                 dp[i][j]=max(dp[i+1][j],dp[i+1][j+1])+dp[i][j];
    20             }
    21         }
    22         cout<<dp[1][1]<<endl;
    23     }
    24     return 0;
    25 } 
  • 相关阅读:
    操作系统概念(第十一章) 文件系统实现
    Linux内核中网络数据包的接收-第一部分 概念和框架
    【技术文档】jeecg3.7-maven搭建好开发环境入门
    memcache源码编译安装
    Linux系统级日志系统
    shell流程控制
    EOF多行写入文件防止变量替换
    zip压缩解压
    shell变量的截取总结
    对linux安装中文字体库
  • 原文地址:https://www.cnblogs.com/Kiven5197/p/7347748.html
Copyright © 2011-2022 走看看