HDU 1579 Function Run Fun(记忆化搜索)
来源:互联网 发布:json 特殊字符 编辑:程序博客网 时间:2024/05/22 14:51
Function Run Fun
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2519 Accepted Submission(s): 1324
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.
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 12 2 210 4 650 50 50-1 7 18-1 -1 -1
Sample Output
w(1, 1, 1) = 2w(2, 2, 2) = 4w(10, 4, 6) = 523w(50, 50, 50) = 1048576w(-1, 7, 18) = 1
Source
冬练三九之一
/*if a <= 0 or b <= 0 or c <= 0, then w(a, b, c) returns: 1if 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)数组开三维22就行 */#include<iostream>#include <string.h>using namespace std;int num[22][22][22]; int w(int a,int b,int c){if(a<=0||b<=0||c<=0) return 1;if(a>20||b>20||c>20) return num[20][20][20]=w(20,20,20);if(num[a][b][c]!=-1) return num[a][b][c];if(a<b&&b<c) return num[a][b][c]=w(a,b,c-1)+w(a,b-1,c-1)-w(a,b-1,c);return num[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; memset(num,-1,sizeof(num)); 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;}
0 0
- HDU--1579 -- Function Run Fun [记忆化搜索] [深搜]
- hdu 1579 Function Run Fun 记忆化dp搜索
- HDU 1579 Function Run Fun(记忆化搜索)
- (hdu 1579)Function Run Fun (记忆化搜索)
- 【HDU 1331 Function Run Fun】+ 记忆搜索
- hdu 1331 Function Run Fun(记忆化搜索)
- HDU--1331--Function Run Fun--记忆化搜索
- HDU 1331 Function Run Fun (基础记忆化搜索)
- HDU 1331 Function Run Fun(记忆化搜索)
- Hdu oj 1331 Function Run Fun(记忆化搜索)
- HDU-1331-Function Run Fun(记忆化搜索,dp)
- HDU-1331 Function Run Fun (记忆化搜索)
- Function Run Fun(记忆化搜索)
- POJ-1579-Function Run Fun-递归,记忆化搜索
- POJ 1579 Function Run Fun【记忆化搜索】
- POJ 1579 Function Run Fun 记忆化搜索
- poj-1579-Function Run Fun(记忆化搜索)
- poj 1579 Function Run Fun 记忆化搜索
- 事务隔离级别
- can't open /dev/tty2: No such file or directory问题解决 亲自实验
- Unity3D调用摄像头显示当前拍摄画面
- CSS3过渡
- 脉冲耦合神经网络
- HDU 1579 Function Run Fun(记忆化搜索)
- 存储过程概念
- 【脚本化文档】——文档和元素的几何形状和滚动
- 大型网站的 HTTPS 实践(1):HTTPS 协议和原理
- Android 5.0状态栏和导航栏
- PUK 1028 WebNavigation
- 遗传算法优化BP神经网络续
- 设计模式之观察者模式
- jQuery的四个加载方式