FZU 1004----Number Triangle
来源:互联网 发布:软件集成测试方案 编辑:程序博客网 时间:2024/05/14 23:25
Description
Consider the number triangle shown below. Write a program that calculates the highest sum of numbers that can be 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.
7 3 8 8 1 0 2 7 4 44 5 2 6 5
In the sample above, the route from 7 to 3 to 8 to 7 to 5 produces the highest sum: 30.
Input
There are multiple test cases.The first line of each test case contains R (1 <= R <= 1000), the number of rows. Each subsequent line contains the integers for that particular row of the triangle. All the supplied integers are non-negative and no larger than 100.
Output
Print a single line containing the largest sum using the traversal specified for each test case.
Sample Input
573 88 1 02 7 4 44 5 2 6 5
Sample Output
30
#include<stdio.h>int a[1005][1005],dp[1005][1005];int max(int a,int b){ return a>b?a:b;}int main(void){int i,j,n;while(scanf("%d",&n)!=EOF){for(i=0;i<n;i++){for(j=0;j<=i;j++){scanf("%d",&dp[i][j]);}}for(i=n-2;i>=0;i--){for(j=0;j<=i;j++){dp[i][j]=dp[i][j]+max(dp[i+1][j],dp[i+1][j+1]);}}printf("%d\n",dp[0][0]);}return 0;}
0 0
- FZU 1004----Number Triangle
- FZU 1004 Number Triangle(简单DP)
- FZU 1004 Number Triangle【数塔dp】
- FOJ 1004 Number Triangle
- FOJ 1004 Number Triangle
- FOJ Problem 1004 Number Triangle
- FOJ Problem 1004 Number Triangle
- Number Triangle
- Number Triangle
- Number Triangle
- FZU 1004 || HOJ 1058 Number Triangles
- Foj 1004 Number Triangle[ 数塔 ]
- FZU 1853 Number Deletion
- FZU 2019 Mountain Number
- fzu 2109 Mountain Number
- FZU 2111 Min Number
- FZU - 2109 Mountain Number
- fzu 1050 Number lengths
- GitHub详细教程
- apache vhost配置
- find -mtime n
- 黑马程序员——java基础——String类和IO
- gdb调试(1)-查看内存
- FZU 1004----Number Triangle
- 计算机视觉领域的一些牛人博客,超有实力的研究机构等的网站链接
- AChartEngine折线图实例
- P67 4
- GIT在Linux上的安装和使用简介
- Mac下Mysql导出sql语句的方法及可能遇到的mysqldump: command not found
- 程序员如何选择技术方向
- P67 5
- Android广播大全1