zoukankan      html  css  js  c++  java
  • nyoj_18_The Triangle_201312071533

    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
    上传者
    苗栋栋
     1 #include <stdio.h>
     2 
     3 int main()
     4 {
     5     int s[110][110]={0};
     6     int i,j,n;
     7     int max=0,t;
     8     scanf("%d",&n);
     9     for(i=1;i<=n;i++)
    10     {
    11         for(j=1;j<=i;j++)
    12         {
    13             scanf("%d",&s[i][j]);
    14             t=(s[i-1][j]>s[i-1][j-1])?s[i-1][j]:s[i-1][j-1];
    15             s[i][j]+=t;
    16         }
    17     }
    18     for(i=1;i<=n;i++)
    19     if(s[n][i]>max)
    20     max=s[n][i];
    21     printf("%d
    ",max);
    22     //while(1);
    23     return 0;
    24 }

    //简单的动态规划

  • 相关阅读:
    iOS堆栈-内存-代码在据算机中的运行
    iOS self和super的区别
    php代码优化
    缓存雪崩现象解决方案
    缓存失效
    分布式memcache
    Linux下编译安装Memcache
    windows 下安装 php-memcached 扩展
    Linux下安装 php-memcache 扩展
    缓存之文件缓存
  • 原文地址:https://www.cnblogs.com/xl1027515989/p/3463028.html
Copyright © 2011-2022 走看看