The Triangle
Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 46949 Accepted: 28429
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
本题是一道简单的动态规划问题,大意是从三角形顶点出发,到达底部路径和最大为多少,输出最大路径值。
//C++代码
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int dp[110][110],num[110][110];
int main(){
int N;
cin>>N;
memset(dp,0,sizeof(dp));
memset(num,0,sizeof(num));
//输入
for(int i=1;i<=N;i++){
for(int j=1;j<=i;j++){
cin>>num[i][j];
}
}
//初始化
for(int i=1;i<=N;i++){
dp[N][i]= num[N][i];
}
for(int i=N-1;i>=1;i--){
for(int j=1;j<=i;j++){
//状态转移方程
dp[i][j]=max(dp[i+1][j],dp[i+1][j+1])+num[i][j];
}
}
cout<<dp[1][1]<<endl;
return 0;
}
//java代码
import java.util.Scanner;
public class Main {
static int[][]dp = new int[101][101];
static int[][]num = new int[101][101];
public static int max(int a,int b){
return a > b ? a:b;
}
public static void main(String[] args){
Scanner in = new Scanner(System.in);
//数据读取
int N = in.nextInt();
for(int i=1;i<=N;i++){
for(int j=1;j<=i;j++){
num[i][j] = in.nextInt();
}
}
//dp数组初始化
for(int i=1;i<=N;i++){
dp[N][i] = num[N][i];
}
for(int i=N-1;i>0;i--){
for(int j=1;j<=i;j++){
dp[i][j] = num[i][j] + max(dp[i+1][j], dp[i+1][j+1]);
}
}
System.out.println(dp[1][1]);
}
}
同样的算法,在北大oj上C++能AC,java就runtimeError了,没看懂,哪位小伙伴看出来了请告知,O(∩_∩)O谢谢!!