poj 1163 the triangle 记忆化搜索

#include<iostream>
using namespace std;
int dp[101][101];
int map[101][101];
int n;
int maxi(int a,int b)
{
if(a>b)
return a;
else return b;
}
int search(int i,int j)
{
if(dp[i][j]!=-1)
return dp[i][j];
if(i==n)
{
dp[i][j]=map[i][j];
return dp[i][j];
}
dp[i][j]=maxi(search(i+1,j),search(i+1,j+1))+map[i][j];
return dp[i][j];
}
int main()
{
cin>>n;
int i,j;
for(i=1;i<=n;i++)
for(j=1;j<=i;j++)
{
cin>>map[i][j];
dp[i][j]=-1;
}
cout<<search(1,1)<<endl;
return 0;
}