动态规划记忆化搜索--Function Run Fun

Function Run Fun

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 5401    Accepted Submission(s): 2536

Problem 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 Northwe 1999

该题算是让我们改进他给的递归公式，这里使用的是记忆化搜索

记忆化搜索： 记忆化搜索=搜索的形式+动态规划的思想。 记忆化搜索：算法上依然是搜索的流程，但是搜索到的一些解用 动态规划 的那种思想和模式作一些保存。 一般说来，动态规划总要遍历所有的状态，而搜索可以排除一些无效状态。 记忆化算法在求解的时候还是按着自顶向下的顺序，但是每求解一个状态，就将它的解保存下来， 以后再次遇到这个状态的时候，就不必重新求解了。

代码：

#include<stack>
#include<queue>
#include<math.h>
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<algorithm>
using namespace std;
int dp[57][57][57];
int f(int a,int b,int 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)
        dp[a][b][c]=f(a,b,c-1)+f(a,b-1,c-1)-f(a,b-1,c);
    else
        dp[a][b][c]=f(a-1,b,c)+f(a-1,b-1,c)+f(a-1,b,c-1)-f(a-1,b-1,c-1);
    return dp[a][b][c];
}
int main()
{
    int a,b,c,ans=0;
    while(scanf("%d%d%d",&a,&b,&c)!=EOF)
    {
        if(a==-1&&b==-1&&c==-1)
            break;
        ans=f(a,b,c);
        printf("w(%d, %d, %d) = %d\n",a,b,c,ans);
    }
    return 0;
}