problem:
有如下所示的数塔,要求从顶层走到底层,若每一步只能走到相邻的结点,则经过的结点的数字之和最大是多少?
#include "stdio.h"
#include "string.h"
#define MAX 10
int num[MAX][MAX];
//使用递归计算,
int d (int i,int j,int n) {
if (i == n) {
return num[i][j];
}else{
int t = d(i+1,j,n);
int t2 = d(i+1,j+1,n);
printf ("(%d,%d)和(%d,%d)递归回来了\n",i+1,j,i+1,j+1);//可以说明相同的子问题被重复计算了多次
if (t2 > t) {http://event.weibo.com/950796
t = t2;
}
return num[i][j] + t;
}
}
int r[MAX][MAX];
//递推计算
int d2 (int n) {
int i,j;
for (i = 1;i <= n;i++) {
r[n][i] = num[n][i];
}
for (i = n - 1;i >= 1;i--) {
for (j = 1;j <= i;j++) {
int t = num[i][j] + r[i+1][j];
int t2 = num[i][j] + r[i+1][j+1];
if (t < t2) {
t = t2;
}
r[i][j] = t;
}
}
return r[1][1];
}
//记忆化搜索
int a[MAX][MAX];
int d3 (int i,int j,int n) {
if (i == n) {
return num[i][j];
}
if (a[i][j] >= 0) {
return a[i][j];
}else {
int t = d3 (i+1,j,n);
int t2 = d3 (i+1,j+1,n);
if (t < t2) {
t = t2;
}
return a[i][j] = t + num[i][j];
}
}
int main () {
int n;
int i,j;
scanf ("%d",&n);
for (i = 1;i <= n;i++) {
for (j = 1;j <= i;j++) {
scanf ("%d",&num[i][j]);
}
}
printf ("%d\n",d(1,1,n));
printf ("%d\n",d2(n));
memset (a,-1,sizeof(a));
printf ("%d\n",d3(1,1,n));
return 0;
}