POJ 1579 记忆化搜索

Function Run Fun

Description

We all love recursion! Don’t we?

Consider a three-parameter recursive function w(a, b, c):

if a <= 0 or b <= 0 or c <= 0, then w(a, b, c) returns:
1

if a > 20 or b > 20 or c > 20, then w(a, b, c) returns:
w(20, 20, 20)

if a < b and b < c, then w(a, b, c) returns:
w(a, b, c-1) + w(a, b-1, c-1) - w(a, b-1, c)

otherwise it returns:
w(a-1, b, c) + w(a-1, b-1, c) + w(a-1, b, c-1) - w(a-1, b-1, c-1)

This is an easy function to implement. The problem is, if implemented directly, for moderate values of a, b and c (for example, a = 15, b = 15, c = 15), the program takes hours to run because of the massive recursion.
Input

The input for your program will be a series of integer triples, one per line, until the end-of-file flag of -1 -1 -1. Using the above technique, you are to calculate w(a, b, c) efficiently and print the result.
Output

Print the value for w(a,b,c) for each triple.
Sample Input

1 1 1
2 2 2
10 4 6
50 50 50
-1 7 18
-1 -1 -1
Sample Output

w(1, 1, 1) = 2
w(2, 2, 2) = 4
w(10, 4, 6) = 523
w(50, 50, 50) = 1048576
w(-1, 7, 18) = 1
Source

Pacific Northwest 1999

分析：题意很简单，在这儿我就不翻译了，直接说怎么做；
一开始我以为是有什么数学规律，找啊找啊，找了好久还是没找到，最后就放弃了，看了题解，原来是暴力去递归，我心想，不是递归会炸吗，怎么能A呢？ 再仔细看看，是用了一个标记数组，在递归的过程中，遇到了需要计算的答案，如果以前是计算过的，直接用就好，相当于是一边寻找答案，一边去打表，这样就保证了不用每次都需要用DFS来实现了，（妙~ 啊~）

太菜了，没有想到这个方法

#include <iostream>
#include <cmath>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <cstring>
#include <stack>
#include <string>
using namespace std;

typedef long long ll;
const int N = 1e5+199;
const double Pi = acos(-1);
int dp[30][30][30];
int DFS(int a,int b,int c){
    if(a<=0 || b<=0 || c<=0) return 1;
    if(a>20 || b>20 || c>20) return dp[20][20][20]=DFS(20,20,20);
    if(dp[a][b][c]) return dp[a][b][c];
    else if(a<b && b<c) return dp[a][b][c]=DFS(a,b,c-1)+DFS(a,b-1,c-1)-DFS(a,b-1,c);
    else return dp[a][b][c]=DFS(a-1,b,c)+DFS(a-1,b-1,c)+DFS(a-1,b,c-1)-DFS(a-1,b-1,c-1);
}
int main()
{

    #ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
    #endif // ONLINE_JUDGE
    int a,b,c;
    while(scanf("%d%d%d",&a,&b,&c)!=EOF){
        if(a==-1 && b==-1 && c==-1) break;
        printf("w(%d, %d, %d) = %d\n",a,b,c,DFS(a,b,c));
    }
    return 0;
}