Number Triangle
来源:互联网 发布:网络名誉侵权案例分析 编辑:程序博客网 时间:2024/05/29 07:40
Problem 1004 Number Triangle
Accept: 2248 Submit: 5973
Time Limit: 1000 mSec Memory Limit : 32768 KB
Problem 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]; //第一次定在main内部 堆空间不够 无法创建
int findmax(int i,int j,int R);
int main(){
int R;
while(scanf("%d",&R)!=EOF){
int i,j;
for(i=0;i<R;i++){
for(j=0;j<=i;j++)
scanf("%d",&a[i][j]);
}
int max=findmax(0,0,R);
printf("%d\n",max);
}
return 0;
}
int findmax(int i,int j,int R){
if(i<R-1){
int left,right;
left=findmax(i+1,j,R);
right=findmax(i+1,j+1,R);
return left>right?left:right + a[i][j];
}
return a[i][j];
}
int a[1005][1005]; //第一次定在main内部 堆空间不够 无法创建
int findmax(int i,int j,int R);
int main(){
int R;
while(scanf("%d",&R)!=EOF){
int i,j;
for(i=0;i<R;i++){
for(j=0;j<=i;j++)
scanf("%d",&a[i][j]);
}
int max=findmax(0,0,R);
printf("%d\n",max);
}
return 0;
}
int findmax(int i,int j,int R){
if(i<R-1){
int left,right;
left=findmax(i+1,j,R);
right=findmax(i+1,j+1,R);
return left>right?left:right + a[i][j];
}
return a[i][j];
}
0 0
- Number Triangle
- Number Triangle
- Number Triangle
- Number triangle(PKU1163)
- FOJ 1004 Number Triangle
- FOJ 1004 Number Triangle
- FZU 1004----Number Triangle
- 6581 Number Triangle
- 611. Valid Triangle Number
- leetcode611: Valid Triangle Number
- 611. Valid Triangle Number
- 611. Valid Triangle Number
- leetcode611. Valid Triangle Number
- 611. Valid Triangle Number
- 611. Valid Triangle Number
- 611. Valid Triangle Number
- 611. Valid Triangle Number
- 611. Valid Triangle Number
- 虚拟Python环境——virtualenv
- 创建主键时报错:ERROR 1075 (42000): Incorrect table definition; there can be only one auto column and it mus
- jar4
- A. Watchmen
- Android中管理多个Fragment的最佳实践,完美解决保存状态与重影问题(转)
- Number Triangle
- java中的容器collection及其常用的子接口
- java多线程——监视锁(monitor)
- HDU 1232
- Java文件上传的两种方式
- 欢迎使用CSDN-markdown编辑器
- android6.0的SDK不能使用httpClient解决方法
- Java千百问_03基本语法(004)_java中的运算符都有哪些
- HDU 5117 Fluorescent