zoukankan      html  css  js  c++  java
  • NYOJ The Triangle

                                                                                            The Triangle

                                                                                                                           时间限制:1000 ms  |  内存限制:65535 KB
                                                                                                                                                               难度:4
    描述

    7
    3 8
    8 1 0
    2 7 4 4
    4 5 2 6 5
    (Figure 1)
    Figure 1 shows a number triangle. Write a program that calculates the highest sum of numbers passed on a route that starts at the top and ends somewhere on the base. Each step can go either diagonally down to the left or diagonally down to the right.

    输入
    Your program is to read from standard input. The first line contains one integer N: the number of rows in the triangle. The following N lines describe the data of the triangle. The number of rows in the triangle is > 1 but <= 100. The numbers in the triangle, all integers, are between 0 and 99.
    输出
    Your program is to write to standard output. The highest sum is written as an integer.
    样例输入
    5
    7
    3 8
    8 1 0 
    2 7 4 4
    4 5 2 6 5
    
    样例输出
    30
    #include <iostream>
    using namespace std;
    const int N = 105;
    
    int a[N][N];
    
    int main(){
      int i,j,n;
      cin>>n;
      for(i=0;i<n;i++){
        for(j=0;j<=i;j++)
           cin>>a[i][j];}
      for(i=n-2;i>=0;i--){
        for(j=0;j<=i;j++)
        a[i][j]+=max(a[i+1][j],a[i+1][j+1]);
      }
      cout<<a[0][0]<<endl;
      return 0;
      }
    
    


  • 相关阅读:
    P1113 杂务 题解
    P3916 图的遍历 题解
    P5318 【深基18.例3】查找文献 题解
    P2814 家谱 题解
    P3879 [TJOI2010]阅读理解 题解
    P4305 不重复的数字题解
    P1955 [NOI2015] 程序自动分析题解
    P1892 [BOI2003]团伙
    P1525 [NOIP2010 提高组] 关押罪犯
    【610】keras 相关问题说明
  • 原文地址:https://www.cnblogs.com/zhangmingzhao/p/7256451.html
Copyright © 2011-2022 走看看