zoukankan      html  css  js  c++  java
  • B_Dp

    <span style="color:#000099;">/*
    B - 简单dp 例题
    Time Limit:1000MS     Memory Limit:10000KB     64bit IO Format:%I64d & %I64u
    Submit
    
    Status
    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
    By Grant Yuan
    2014.7.16*/
    #include<iostream>
    #include<cstdio>
    #include<cstring>
    #include<cstdlib>
    using namespace std;
    int a[101][101];
    int f[101][101];
    int n;
    int l,r;
    int max(int a1,int a2)
    {
        if(a1>=a2)
          return a1;
        return a2;
    }
    int main()
    {
        while(~scanf("%d",&n)){
              memset(a,0,sizeof(a));
          memset(f,0,sizeof(f));
          for(int i=1;i<=n;i++)
            for(int j=1;j<=i;j++)
             scanf("%d",&a[i][j]);
          for(int i=1;i<=n;i++)
            for(int j=1;j<=i;j++)
              {
                 f[i][j]=max(f[i-1][j],f[i-1][j-1])+a[i][j];
              }
              int m=0;
          for(int i=1;i<=n;i++)
            {
                if(f[n][i]>m)
                  m=f[n][i];
            }
            cout<<m<<endl;
    
          }
    }
    </span>


  • 相关阅读:
    git强行覆盖master分支
    git本地分支推送到远程分支
    gitignore
    copymemory()数组赋值
    加载log文件
    ExtractStrings字符串截取
    GetFileVersionInfoSize函数确定操作系统是否可以检索指定文件的版本信息
    delphi edit边框成为下划线
    delphi 中封装的VCl窗体Tab键响应问题
    delphi Table切换控件顺序问题
  • 原文地址:https://www.cnblogs.com/codeyuan/p/4254510.html
Copyright © 2011-2022 走看看