The Triangle
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 35881 | Accepted: 21482 |
Description
7 3 8 8 1 0 2 7 4 4 4 5 2 6 5 (Figure 1)
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
Source
递推
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int a[100][100];
int max1[100][100];
int n;
int main(){
// freopen("in.txt", "r", stdin);
while(scanf("%d", &n)!=EOF){
for(int i = 0; i < n; i++){
for(int j = 0; j <=i; j++){
scanf("%d", &a[i][j]);
}
}
for(int i = 0; i<n; i++){
max1[n-1][i] = a[n-1][i];
}
for(int i = n-2; i>=0; i--){
for(int j = 0; j <= i; j++){
if(max1[i+1][j]>max1[i+1][j+1]){
max1[i][j] = max1[i+1][j]+a[i][j];
}else{
max1[i][j] = max1[i+1][j+1]+a[i][j];
}
}
}
cout<<max1[0][0]<<endl;
}
return 0;
}
记忆化搜索
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int a[100][100];
int max1[100][100];
int n;
int dp(int x, int y){
if(max1[x][y]>=0){
return max1[x][y];
}
if(x==n-1){
return max1[x][y] = a[x][y];
}
if(dp(x+1, y)>dp(x+1, y+1)){
max1[x][y] = max1[x+1][y]+a[x][y];
}else{
max1[x][y] = max1[x+1][y+1] + a[x][y];
}
return max1[x][y];
}
int main(){
freopen("in.txt", "r", stdin);
while(scanf("%d", &n)!=EOF){
memset(max1, -1, sizeof(max1));
for(int i = 0; i < n; i++){
for(int j = 0; j <=i; j++){
scanf("%d", &a[i][j]);
}
}
cout<<dp(0, 0)<<endl;
}
return 0;
}