zoukankan      html  css  js  c++  java
  • poj 1163 The Triangle



    The Triangle
    Time Limit: 1000MS   Memory Limit: 10000K
    Total Submissions: 46267   Accepted: 28015

    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<stack>
    #include<queue>
    #include<math.h>
    #include<stdio.h>
    #include<cstring>
    #include<string.h>
    #include<iostream>
    #include<stdlib.h>
    #include<algorithm>
    
    
    using namespace std;
    
    int n;
    int map[101][101],maxsum[101][101];
    
    int Maxsum(int i,int j)
    {
        if(maxsum[i][j]!=-1)
            return maxsum[i][j];//记录第一个点至当前点的路径和,并返回->map中
        if(i==n) maxsum[i][j]=map[i][j];
        else
        {
            int x=Maxsum(i+1,j);
            int y=Maxsum(i+1,j+1);
            maxsum[i][j]=max(x,y)+map[i][j];
        }
        return maxsum[i][j];
    }
    
    int main()
    {
        int i,j;
        scanf("%d",&n);
        for(i=1; i<=n; i++)
            for(j=1; j<=i; j++)
            {
                scanf("%d",&map[i][j]);
                maxsum[i][j]=-1;
            }
        printf("%d
    ",Maxsum(1,1));
        return 0;
    }
    
    















  • 相关阅读:
    如何提高PHP执行效率
    PHP MySQL 预处理语句
    CDN拾遗
    Rendering React components to the document body
    模拟select,隐藏下拉列表的几种实现
    前端数据范式化
    其实我们可以少写点if else和switch
    [译]the cost of javascript in 2018(1)
    provisional headers are shown 知多少
    f5到底刷新了点什么,你知道吗
  • 原文地址:https://www.cnblogs.com/nyist-xsk/p/7264911.html
Copyright © 2011-2022 走看看