zoukankan      html  css  js  c++  java
  • POJ1163(基础线性DP)

    The Triangle
    Time Limit: 1000MS   Memory Limit: 10000K
    Total Submissions: 42547   Accepted: 25721

    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"cstdio"
    #include"cstring"
    #include"algorithm"
    using namespace std;
    const int MAXN=1005;
    const int INF=0x3fffffff;
    int n;
    int a[MAXN][MAXN];
    int dp[MAXN][MAXN];
    int main()
    {
        scanf("%d",&n);
        for(int i=0;i<n;i++)
            for(int j=0;j<=i;j++)    scanf("%d",&a[i][j]);
        for(int i=n-1;i>=0;i--)
            for(int j=0;j<=i;j++)    
                dp[i][j]=max(dp[i+1][j],dp[i+1][j+1])+a[i][j];
        printf("%d
    ",dp[0][0]);
        return 0;
    }
  • 相关阅读:
    redis集群方式
    缓存数据库redis相关问题
    mybatis中如何进行多表关联查询
    mabaits出现parma不匹配时 或者参数>number 4 ,解决方法。
    El表达式
    Jsp概述
    Session会话技术
    springMVC之DateSource提示com.mysql.jdbc.Driver找不到
    Oracle查询死锁
    Mybatis 向oracle批量插入与更新数据
  • 原文地址:https://www.cnblogs.com/program-ccc/p/5185669.html
Copyright © 2011-2022 走看看