The Triangle
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 43809 | Accepted: 26430 |
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
就是一数字金字塔
记忆化搜索直接过
#include<cstdio> #include<iostream> #define ref(i,x,y) for(int i=x;i<=y;i++) #define N 101 int a[N][N],f[N][N],n; using namespace std; int dfs(int i,int j){ if(f[i][j]>0) return f[i][j]; return f[i][j]=a[i][j]+(i==n?0:max(dfs(i+1,j),dfs(i+1,j+1))); } int main(){ scanf("%d",&n); ref(i,1,n) ref(j,1,i) scanf("%d",&a[i][j]); dfs(1,1); printf("%d ",f[1][1]); return 0; }
看不懂,没关系,还有一种
#include<cstdio> #include<iostream> #define ref(i,x,y) for(int i=x;i<=y;i++) #define def(i,x,y) for(int i=x;i>=y;i--) #define N 101 int a[N][N],f[N][N],n; using namespace std; int main(){ scanf("%d",&n); ref(i,1,n) ref(j,1,i) scanf("%d",&a[i][j]); ref(i,1,n) f[n][i]=a[n][i]; def(i,n-1,1) ref(j,1,i) f[i][j]+=a[i][j]+max(f[i+1][j],f[i+1][j+1]); printf("%d ",f[1][1]); return 0; }