HDU-1331 Function Run Fun(记忆化搜索)

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

给你一个函数让你实现,但是这其中有很多重复计算的部分,比如15 15 15,直接调用函数会超时。

所以在计算的时候,保存下已经计算过的值,节省掉这部分时间:

#include<iostream>
using namespace std;
typedef long long ll;
ll m[50][50][50];
ll w(ll a,ll b,ll c){
	if(a<=0||b<=0||c<=0) return 1;
	if(m[a][b][c]) return m[a][b][c];
	else if(a>20||b>20||c>20){
		return w(20,20,20);
	}
	else if(a<b&&b<c){
		return m[a][b][c]=w(a,b,c-1)+w(a,b-1,c-1)-w(a,b-1,c);
	}
	else return m[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(){
	ll a,b,c;
	while(cin>>a>>b>>c){
		if(a==-1&&b==-1&&c==-1) break;
		cout<<"w("<<a<<", "<<b<<", "<<c<<") = "<<w(a,b,c)<<endl;
	}
	return 0;
}

 

发布了153 篇原创文章 · 获赞 43 · 访问量 6万+
展开阅读全文

没有更多推荐了,返回首页

©️2019 CSDN 皮肤主题: 技术黑板 设计师: CSDN官方博客

分享到微信朋友圈

×

扫一扫,手机浏览