poj1163
1148 단어 동태
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
#define M 101
int maxsum[M][M],D[M][M];
int n;
int Maxsum(int i,int j)
{
if(maxsum[i][j]!=-1)
return maxsum[i][j];
if(i==n)
maxsum[i][j]=D[i][j];
else
{
int x=Maxsum(i+1,j);
int y=Maxsum(i+1,j+1);
maxsum[i][j]=max(x,y)+D[i][j];
}
return maxsum[i][j];
}