研0 冲刺算法竞赛 day24 P1464 Function

P1464 Function - 洛谷 | 计算机科学教育新生态 (luogu.com.cn)

考点：递归记忆

思路：将两种情况记录在dp[][][]数组中，其余直接按题意解即可

代码：

#include<iostream>
#define ll long long
using namespace std;


ll dp[25][25][25];

ll w(ll a,ll b,ll c)
{
	if (a <= 0 || b <= 0 || c <= 0)		return 1;
	if (a > 20 || b > 20 || c > 20)		return w(20,20,20);
	if (a < b && b < c)
	{
		if (dp[a][b][c - 1] == 0)		dp[a][b][c - 1] = w(a, b, c - 1);
		if (dp[a][b - 1][c - 1] == 0)	dp[a][b - 1][c - 1] = w(a, b - 1, c - 1);
		if (dp[a][b - 1][c] == 0)		dp[a][b - 1][c] = w(a, b - 1, c);
		dp[a][b][c]=dp[a][b][c - 1] + dp[a][b - 1][c - 1] - dp[a][b - 1][c];
	}
	else 
	{
		if (dp[a - 1][b][c] == 0)			dp[a - 1][b][c] = w(a - 1, b, c);
		if (dp[a - 1][b - 1][c] == 0)		dp[a - 1][b - 1][c] = w(a - 1, b - 1, c);
		if (dp[a - 1][b][c - 1] == 0)		dp[a - 1][b][c - 1] = w(a - 1, b, c - 1);
		if (dp[a - 1][b - 1][c - 1] == 0)	dp[a - 1][b - 1][c - 1] = w(a - 1, b - 1, c - 1);
		dp[a][b][c] = dp[a - 1][b][c] + dp[a - 1][b - 1][c] + dp[a - 1][b][c - 1] - dp[a - 1][b - 1][c - 1];
	}
	return dp[a][b][c];
}

int main()
{
	ll a, b, c;
	while (cin >> a >> b >> c)
	{
		if (a == -1 && b == -1 && c == -1)
		{
			return 0;
		}
		printf("w(%lld, %lld, %lld) = ", a, b, c);
		printf("%lld\n", w(a, b, c));
	}
}

总结：思考dp数组在哪里用