dp数塔问题

动态规划
1递归计算相当于二叉树遍历
相当于先算最后一层最大值然后算最后两层最大值，然后最后3层，一直到最顶端
#include<iostream>
#include<algorithm>
using namespace std;
int a[1005][1005],b[1005],i,j,k,l,n;
int d(int i,int j)
{return a[i][j]+(i==n?0:max(d(i+1,j),d(i+1,j+1)));}//max(d(i+1,j)从这开始遍历
int main()
{ 
	cin>>n;
	for(i=1;i<=n;i++)
     for(j=1;j<=i;j++)
	 { cin>>a[i][j];}
	 k=d(1,1);
	 cout<<k<<endl;
}
递归函数的另一种写法
int f(int i, int j){
    if(i == n) return a[i][j];
    return max(f(i+1, j), f(i+1, j+1)) + a[i][j]; //max() is included in <algorithm



2记忆化搜索
#include<iostream>
#include<algorithm>
using namespace std;
int a[1005][1005],b[1005][1005],i,j,k,l,n;
int d(int i,int j)
{  if(b[i][j]>=0)return b[i][j];
	return b[i][j]=a[i][j]+(i==n?0:max(d(i+1,j),d(i+1,j+1)));}
int main()
{ 
	cin>>n;
	for(i=1;i<=n;i++)
     for(j=1;j<=i;j++)
	 { cin>>a[i][j];}
	 memset(b,-1,sizeof(b));
	 k=d(1,1);
	 cout<<k<<endl;
}

3递推法动态规划
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
int a[1005][1005],b[1005][1005],i,j,k,l,n;
int main()
{ 
	cin>>n;
	for(i=1;i<=n;i++)
     for(j=1;j<=i;j++)
	 { cin>>a[i][j];}
	for(j=1;j<=n;j++)b[n][j]=a[n][j];
		for(i=n-1;i>=1;i--)
			for(j=1;j<=i;j++)
				b[i][j]=a[i][j]+max(b[i+1][j],b[i+1][j+1]);
		cout<<b[1][1]<<endl;
}


可实现多次输入
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
int a[1005][1005],b[1005][1005],i,j,k,l,n;
int d(int i,int j)
{  if(b[i][j]>=0)return b[i][j];
	return b[i][j]=a[i][j]+(i==n?0:max(d(i+1,j),d(i+1,j+1)));}
int main()
{int m;
cin>>m;
while(m--)
	{cin>>n;
	for(i=1;i<=n;i++)
     for(j=1;j<=i;j++)
	 { cin>>a[i][j];}
	 memset(b,-1,sizeof(b));
	 k=d(1,1);
	 cout<<k<<endl;
}
}