zoukankan      html  css  js  c++  java
  • nyoj 18 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<stdio.h>
    #include<string.h>
    #include<algorithm>
    int a[105][105];
    int dp[105][105];
    using namespace std;
    int main()
    {
    	int n;
    	while(scanf("%d",&n)!=EOF)
    	{
    		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++)
    			dp[n][i]=a[n][i];
    		for(int i=n-1;i>=1;i--)
    			for(int j=1;j<=i;j++)
    				dp[i][j]=max(dp[i+1][j],dp[i+1][j+1])+a[i][j];
    		printf("%d
    ",dp[1][1]);
    	}
    	return 0;
    }
    

      

  • 相关阅读:
    影响Java EE性能的十大问题
    Android APK加壳技术方案【2】
    动态实时跟踪你的java程序
    ASP.NET MVC载入页面常用方法
    JavaWeb禁用浏览器缓存
    JavaWebresponse两个流
    nslookup命令用法
    GDAL交流 QQ群
    事件(二)——Jquery事件模型
    浅谈meta标签
  • 原文地址:https://www.cnblogs.com/zhangliu/p/7053323.html
Copyright © 2011-2022 走看看