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

    http://poj.org/problem?id=1163

    The Triangle
    Time Limit: 1000MS   Memory Limit: 10000K
    Total Submissions: 32923   Accepted: 19514

    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

    Source

    [Submit]   [Go Back]   [Status]   [Discuss]

    Home Page   Go Back  To top

    简单的动态规划。。。

     By LFENG
     
    #include<stdio.h>
    int main()
    {
        
    int a[102][102];
        
    int n,i,j;
        scanf(
    "%d",&n);
        
    for(i=0;i<n;i++)
        
    for(j=0;j<=i;j++)
        scanf(
    "%d",&a[i][j]);
        
    for(i=n-2;i>=0;i--)
        
    for(j=0;j<=i;j++)
        a[i][j]+=(a[i+
    1][j]>a[i+1][j+1])?a[i+1][j]:a[i+1][j+1];
        printf(
    "%d ",a[0][0]);
        
    return 0;
    }
  • 相关阅读:
    JAVA核心技术笔记总结--第14章 线程总结
    java核心技术笔记——第 9 章 集合
    Java核心技术笔记——第 8 章 泛型
    2.面向对象三大特征
    1.浅谈面向对象思想
    8.字符串
    7.数组
    6.调试程序
    5.流程控制语句
    4.运算符
  • 原文地址:https://www.cnblogs.com/lfeng/p/3149002.html
Copyright © 2011-2022 走看看