zoukankan      html  css  js  c++  java
  • POJ-1163 The Triangle

    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 <iostream>
    #include <cstdio>
    #include <algorithm>
    using namespace std;
    
    int main(void)
    {
        int num[110][110], dp[110][110];
        int n;
        
        memset(dp, -1, sizeof(dp));
        cin >> n;
        for(int i = 0; i < n; i++)    {
            for(int j = 0; j <= i; j++)    {
                scanf("%d", &num[i][j]);
                if(i == n-1)
                    dp[i][j] = num[i][j];
            }
        }
        
        for(int i = n-2; i >= 0; i--)   {
            for(int j = 0; j <= i; j++)    {
                dp[i][j] = max(dp[i+1][j]+num[i][j], dp[i+1][j+1]+num[i][j]);
                
            }
        }
        
        cout << dp[0][0] << endl;
        
        return 0;
    }
    
  • 相关阅读:
    mac 环境下adb的安装
    iOS开发Swift版本
    UILabel-Swift
    Android应用上架
    Android应用开发
    andriod
    Android 6.0 更新包与已安装应用的签名不一致
    苹果手机怎么录屏 iOS12设置录屏
    Siri语音唤醒的开启与语音矫正
    Git的工作流程
  • 原文地址:https://www.cnblogs.com/limyel/p/7198641.html
Copyright © 2011-2022 走看看