记忆化搜索--poj 1597 Function Run Fun

http://poj.org/problem?id=1579

如果按平常写会超时

long long dfs(int x, int y, int z)
{
    if(x <= 0 || y <= 0 || z <= 0){
        return  1;
    }
    if(x > 20 || y > 20 || z > 20){
        x = y = z = 20;
    }

    if(x < y && y < z){
        return dfs(x, y, z - 1) + dfs(x, y - 1, z - 1) - dfs(x, y - 1, z);
    } 
    else{
        return dfs(x - 1, y, z) + dfs(x - 1, y - 1, z) + dfs(x - 1, y, z - 1) - dfs(x - 1, y - 1, z - 1);

    } 
}

#include<iostream>
#include<cstring>
#include<stdio.h>
using namespace std;
long long dp[21][21][21];

long long dfs(int x, int y, int z)
{
    if(x <= 0 || y <= 0 || z <= 0){
        return  1;
    }
    if(dp[x][y][z]){
        return dp[x][y][z];
    }

    if(x < y && y < z){
        dp[x][y][z] = dfs(x, y, z - 1) + dfs(x, y - 1, z - 1) - dfs(x, y - 1, z);
    } 
    else{
        dp[x][y][z] = dfs(x - 1, y, z) + dfs(x - 1, y - 1, z) + dfs(x - 1, y, z - 1) - dfs(x - 1, y - 1, z - 1);

    } 
    return dp[x][y][z];
}
int main()
{
    int i;
    int x, y, z;
    memset(dp, 0, sizeof(dp));
    while(1)
    {
        cin >> x >> y >> z;
        if(x == -1 && y == -1 && z == -1)
        {
            break;
        }

        long long ans;
        if(x <= 0 || y <= 0 || z <= 0){
            ans = 1;
        }
        else if(x > 20 || y > 20 || z > 20){
            ans = dfs(20, 20, 20);
        }
        else{
            ans = dfs(x, y, z);
        }

        printf("w(%d, %d, %d) = %lld\n", x, y, z, ans);
    }
    return 0;
}