#总结一下
记忆化搜索是一种“从顶至底”的方法,从原问题出发,递归地将较大的子问题拆分成较小的子问题,知道拆分到已知解,之后,回溯,构建原问题的解。
递归+记忆化搜索
#include<iostream>
using namespace std;
#define ll long long
ll dp[30][30][30] = {0};//存储重复数据
ll f(ll a, ll b, ll c)
{
if (a <= 0 || b <= 0 || c <= 0)return 1;
if (a > 20 || b > 20 || c > 20)return f(20, 20, 20);
if(dp[a][b][c])return dp[a][b][c];//如果有记忆,则直接返回
if (a < b && b < c) {
if (dp[a][b][c - 1] == 0)//如果没有记忆,就进行存储
{
dp[a][b][c - 1] = f(a, b, c - 1);
}
if (dp[a][b - 1][c - 1] == 0)
{
dp[a][b - 1][c - 1] = f(a, b - 1, c - 1);
}
if(dp[a][b - 1][c]==0){
dp[a][b - 1][c] = f(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] = f(a - 1, b, c);
}
if (dp[a - 1][b - 1][c] == 0)
{
dp[a - 1][b - 1][c] = f(a - 1, b - 1, c);
}
if (dp[a - 1][b][c - 1]==0)
{
dp[a - 1][b][c - 1] = f(a - 1, b, c - 1);
}
if(dp[a - 1][b - 1][c - 1]==0) {
dp[a - 1][b - 1][c - 1] = f(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 (true)//循环输入
{
cin >> a >> b >> c;
if (a == -1 && b == -1 && c == -1)break;
cout << "w(" << a << ", " << b << ", " << c << ") = " << f(a, b, c)<<endl;
}
}