hdu 1579 Function Run Fun 记忆化dp搜索

Function Run Fun

Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2351    Accepted Submission(s): 1226

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

冬练三九之一

 

Recommend

lcy   |   We have carefully selected several similar problems for you:   1730  1203  1723  2285  1204 

 

解题思路：看到题目首先用的递归，但发现50 ，50 ，50，就陷进去了，直接会导致超时。没有办法，看到网上说，记忆化，就是将已经计算出的记忆下来，从中间剩下一些时间。

开个三维数组，进行记忆化。。。

//记忆化dp搜索 
#include<stdio.h>
#include<string.h>
int map[21][21][21];
int W(int a ,int b, int c)
{
	if(a<=0||b<=0||c<=0)
	{
		return 1;
	}
	else if(a>20||b>20||c>20)
	{
		return W(20,20,20);
	}
	else if(a<b&&b<c)
	{
		if(map[a][b][c]) /*如果此处已经计算出来了，就记录下来*/ return map[a][b][c];
		return map[a][b][c]= W(a, b, c-1) + W(a, b-1, c-1) - W(a, b-1, c);
	}
	else
	{
		if(map[a][b][c])  /*如果此处已经计算出来了，就记录下来*/ return map[a][b][c];
		return map[a][b][c]=W(a-1, b, c) + W(a-1, b-1, c) + W(a-1, b, c-1) - W(a-1, b-1, c-1);
	}
}
int main()
{
	int a,b,c;
	int t;
	while(scanf("%d%d%d",&a,&b,&c)&&!(a==-1&&b==-1&&c==-1))
	{
		t=W(a,b,c);
		printf("w(%d, %d, %d) = %d\n",a,b,c,t);
	} 
}