HDOJ题目1331 Function Run Fun(DFS记忆化)
来源:互联网 发布:暑期软件测试培训 编辑:程序博客网 时间:2024/05/05 20:28
Function Run Fun
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2559 Accepted Submission(s): 1241
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
Pacific Northwest 1999
Recommend
Ignatius.L | We have carefully selected several similar problems for you: 1074 1078 1208 1355 1158
ac代码
#include<stdio.h>#include<string.h>int dp[30][30][30];int w(int a,int b,int c){if(a<=0||b<=0||c<=0)return1;if(a>20||b>20||c>20)return w(20,20,20);if(dp[a][b][c])return dp[a][b][c];if(a<b&&b<c)return dp[a][b][c]=w(a,b,c-1)+w(a,b-1,c-1)-w(a,b-1,c);return dp[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;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,w(a,b,c));}}
0 0
- HDOJ题目1331 Function Run Fun(DFS记忆化)
- hdoj 1331 Function Run Fun 【记忆化搜索】
- 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(记忆化递归)
- HDU-1331 Function Run Fun (记忆化搜索)
- POJ 题目1579 Function Run Fun(记忆搜索)
- hdoj 1331 Function Run Fun(模拟)
- hdoj 1331 Function Run Fun
- [递归理解/记忆化] HDU/HOJ 1331 Function Run Fun
- hdu 1331||1579 Function Run Fun(记忆化)
- HDU--1331--Function Run Fun--记忆化搜索
- HDU 1331 Function Run Fun (基础记忆化搜索)
- HDU 1331 Function Run Fun(记忆化搜索)
- 【HDU 1331 Function Run Fun】+ 记忆搜索
- poj Function Run Fun(DP)(记忆化搜索)
- kuwahara filter 实现
- mongo 三个shard重要的命令
- vim查找/替换字符串
- AssetsManager.cpp 手动修改后的类
- 权限管理_CPS_FUNC_PERMISSION_DATA
- HDOJ题目1331 Function Run Fun(DFS记忆化)
- 第1章 统计学习方法概论——第4~6节 模型选择、正则化和交叉验证、泛化能力
- c++: Does the new operator for dynamic allocation check for memory safety?
- 常见排序算法的时间复杂度、稳定性总结
- C++ AMP 概述
- AndroidStudio相关 2015-3-25
- Linux 动态库(.so)、静态库(.a)
- hdu 3667 Transportation(最小费用最大流 拆边)
- 蓝桥杯 扑克牌移动