代码如下：
#include <iostream>
using namespace std;

int** nodeval;
int n;
int routesum(int i, int j) {
    int lb, rb;
    if (i==n) {
              return nodeval[i][j];
    }
    else {
         (lb=nodeval[i][j]+routesum(i+1,j));
         (rb=nodeval[i][j]+routesum(i+1,j+1));
         return ((rb>lb) ? rb : lb );
    }
}

int main(void) {
    int r,c;
    cin>>n;
    if (n>0 && n<=100) {
          nodeval = new int*[n+1];
          for (r=1; r<=n; r++) {
              nodeval[r] = new int[r+1];
          }
          for (r=1; r<=n; r++) {
              for (c=1; c<=r; c++) {
                  scanf("%d", &nodeval[r][c]);
              }
          }
          cout<<routesum(1,1)<<endl;
    }
    return 0;
}
高手看看，是不是递归深度（题目要求100行）太大了，要用非递归算法？谢谢。

• Re:比较简单的1163，为什么TLE? (12) tangwangyang 2006-05-12 21:06:22