zoukankan      html  css  js  c++  java
  • POJ-1163-The Triangle (动态规划1)

    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
    #include <stdio.h>
    #include <algorithm>
    using namespace std;
    int n,a[101][101];
    void dp()
    {
        for(int i=n; i>0; i--)
        {
            for(int j=1; j<=i; j++)
            {
                a[i-1][j]+=max(a[i][j],a[i][j+1]);//从底部开始逐个求出最大和
            }
        }
    }
    int main()
    {
    
        while(scanf("%d",&n)!=EOF)
        {
            for(int i=1; i<=n; i++)
            {
                for(int j=1; j<=i; j++)
                {
                    scanf("%d",&a[i][j]);
                }
            }
            dp();
            printf("%d
    ",a[1][1]);
        }
        return 0;
    }
  • 相关阅读:
    tomcat启动与关闭脚本
    SqlAlchemy ORM
    python之socket
    python异常处理
    python常用模块
    PYTHON之文件操作
    Linux系统Load average负载详细解释
    tomcat报错:This is very likely to create a memory leak问题解决
    springcloud第一步:创建eureka注册服务
    SpringCloud微服务高级
  • 原文地址:https://www.cnblogs.com/tianmin123/p/4644853.html
Copyright © 2011-2022 走看看