zoukankan      html  css  js  c++  java
  • 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.
    //最基本的dp,数塔:
    #include
    <iostream> using namespace std; int num[105][105]; int dp(int num[105][105],int n) {
    for(int i = n ; i >= 1; i--) { for(int j = 1; j <= i-1; j++) { if(num[i][j] > num[i][j+1]) num[i-1][j] += num[i][j]; else num[i-1][j] += num[i][j+1]; } } return num[1][1]; } int main() { int n; while( cin>> n) { for(int i = 1; i <= n;i++) { for(int j = 1; j <= i;j++) { cin>>num[i][j]; } } cout<<dp(num,n)<<endl; } return 0; }
  • 相关阅读:
    Day9
    Day9
    Day9
    洛谷 P1896 [SCOI2005]互不侵犯
    洛谷 P1879 [USACO06NOV]玉米田Corn Fields
    Day9
    最大m段子段和 Day9
    jsp内置对象-application对象
    jsp内置对象-session对象
    jsp内置对象-response对象
  • 原文地址:https://www.cnblogs.com/T8023Y/p/3224470.html
Copyright © 2011-2022 走看看