zoukankan      html  css  js  c++  java
  • poj 1163 The Triangle

                                                                 The Triangle
    Time Limit: 1000MS   Memory Limit: 10000K
    Total Submissions: 43809   Accepted: 26430

    Description

    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. 

    Input

    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.

    Output

    Your program is to write to standard output. The highest sum is written as an integer.

    Sample Input

    5
    7
    3 8
    8 1 0 
    2 7 4 4
    4 5 2 6 5

    Sample Output

    30

    Source

     1 #include<cstdio>
     2 #include<iostream>
     3 #define N 100+10
     4 
     5 using namespace std;
     6 
     7 int a[N][N],n;
     8 
     9 int main()
    10   {
    11       scanf("%d",&n);
    12       for(int i=1;i<=n;i++)
    13         for(int j=1;j<=i;j++)        //数字三角形的读入 
    14           scanf("%d",&a[i][j]);
    15       for(int i=n-1;i>=1;i--)
    16         for(int j=1;j<=i;j++)        //从下向上每一个点都可以加上他两个孩子之中较大的那个,当加到a[1][1]是,就是最大的值
    17                                    //因为不需要输出路径,所以可以直接在原数组上修改 
    18           a[i][j]+=max(a[i+1][j],a[i+1][j+1]);
    19       printf("%d",a[1][1]);
    20       return 0;
    21   }
    22  
    数字三角形
  • 相关阅读:
    14-补充内容:MySQl创建用户和授权
    15-可视化工具Navicat的使用
    11-数据的增删改
    12-单表查询
    09-完整性约束
    10-外键的变种 三种关系
    07-数据类型
    08-数据类型(2)
    Mysql 基本语法
    E. K-periodic Garland
  • 原文地址:https://www.cnblogs.com/yuemo/p/5495328.html
Copyright © 2011-2022 走看看