hdu1579(记忆深搜)
来源:互联网 发布:fs2you mac 编辑:程序博客网 时间:2024/06/14 14:07
Function Run Fun
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3098 Accepted Submission(s): 1595
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
冬练三九之一
#include<stdio.h>#include<string.h> #include<iostream>using namespace std;int dp[50][50][50];int func(int a,int b,int c){if(a<=0||b<=0||c<=0)return 1;if(a>20||b>20||c>20)return func(20,20,20);if(dp[a][b][c]) return dp[a][b][c];if(a<b&&b<c)return dp[a][b][c]=func(a,b,c-1)+func(a,b-1,c-1)-func(a,b-1,c);return dp[a][b][c]=func(a-1,b,c)+func(a-1,b-1,c)+func(a-1,b,c-1)-func(a-1,b-1,c-1);}int main(){int a,b,c; while(1) { scanf("%d%d%d",&a,&b,&c); if(a==b&&b==c&&a==-1) break; printf("w(%d, %d, %d) = %d\n",a,b,c,func(a,b,c));}return 0;}
阅读全文
0 0
- hdu1579(记忆深搜)
- hdu1579 Function Run Fun(深搜+记忆化)
- hdu1579 Function Run Fun 记忆化搜索启蒙题
- HDU1331 HDU1579 Function Run Fun【记忆化搜索】
- HDU1579 Function Run Fun(DP,记忆化搜索)
- HDU1579(DP)
- hdu1579简单的用dp优化递归
- Function Run Fun hdu1579 递推
- Function Run Fun(hdu1579,打表水题)
- 记忆
- 记忆
- 记忆
- 记忆
- 记忆
- 记忆
- 记忆
- 记忆
- 记忆
- 关于红米3(开发版)如何修改host文件访问谷歌
- 服务跨域以及Session保持问题
- Excel 中连续生成开始日期和结束日期之间的日期
- The C Programming Language的小代码
- 机器学习之监督学习-回归
- hdu1579(记忆深搜)
- Codeforces 840D:Destiny
- Strange Way to Express Integers 扩展欧几里得
- Spring Boot+log4j2+yml配置
- java 图形用户界面编程 之 事件处理
- JavaScript实现rgb转为16进制
- HDU 2813 One fihgt one(KM算法解决最小权值匹配)
- 感触
- VxWorks讨论群 166692882