百练 2760:数字三角形

百练 2760:数字三角形

1. 递归解决（超时）

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
const int N=500;;
using namespace std;
int dp[N][N],n;
int smax(int x,int y)
{
	if (x==n) return dp[x][y];
	return dp[x][y]+max(smax(x+1,y),smax(x+1,y+1));
}
int main()
{
//	freopen ("INPUT.in","r",stdin);
//	freopen ("OUTPUT.out","w",stdout);
	cin>>n;
	for (int i=1;i<=n;i++){
		for (int j=1;j<=i;j++){
			cin>>dp[i][j];
		}
	}
	cout<<smax(1,1); 
	return 0;
}

2. 记忆化递归

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
const int N=500;;
using namespace std;
int dp[N][N],d[N][N],n;
int smax(int x,int y)
{
	if (x==n||d[x][y]) return dp[x][y];
	dp[x][y]+=max(smax(x+1,y),smax(x+1,y+1));
	d[x][y]=1;
	return dp[x][y];
}
int main()
{
//	freopen ("INPUT.in","r",stdin);
//	freopen ("OUTPUT.out","w",stdout);
	cin>>n;
	for (int i=1;i<=n;i++){
		for (int j=1;j<=i;j++){
			cin>>dp[i][j];
		}
	}
	cout<<smax(1,1); 
	return 0;
}

3. 递推

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
const int N=500;;
using namespace std;
int dp[N][N],n;
int main()
{
//	freopen ("INPUT.in","r",stdin);
//	freopen ("OUTPUT.out","w",stdout);
	cin>>n;
	for (int i=1;i<=n;i++){
		for (int j=1;j<=i;j++){
			cin>>dp[i][j];
		}
	}
	for (int i=n-1;i>=1;i--){
		for (int j=1;j<=i;j++)
		  dp[i][j]+=max(dp[i+1][j],dp[i+1][j+1]);
	}
	cout<<dp[1][1];
	return 0;
}