Function Run Fun--CSU-ACM2017暑期训练3-递推与递归
2017-07-27 11:41
417 查看
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
当a,b,c过大时,我们就会发现其实这个过程中某些情况被递归了很多次,浪费了不少的时间。但是只要我们中途当第一次递归到这种情况时能把这个值存储下来,之后的递归再遇到这种情况时就直接用这个值,无需再把这种情况递归下去。这样我们就能节省许多时间。这就是记忆化搜索的基本思想吧。
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
当a,b,c过大时,我们就会发现其实这个过程中某些情况被递归了很多次,浪费了不少的时间。但是只要我们中途当第一次递归到这种情况时能把这个值存储下来,之后的递归再遇到这种情况时就直接用这个值,无需再把这种情况递归下去。这样我们就能节省许多时间。这就是记忆化搜索的基本思想吧。
#include<iostream> #include<cstdio> #include<cstring> using namespace std; int store[24][24][24]; int recur(int a,int b,int c) { if(a<=0||b<=0||c<=0)return 1; if(a>20||b>20||c>20)return recur(20,20,20); if(store[a][b][c])return store[a][b][c]; if(a<b&&b<c) store[a][b][c]=recur(a,b,c-1)+recur(a,b-1,c-1)-recur(a,b-1,c); else store[a][b][c]=recur(a-1,b,c)+recur(a-1,b-1,c)+recur(a-1,b,c-1)-recur(a-1,b-1,c-1); return store[a][b][c]; } int main() { int a,b,c; memset(store,0,sizeof(store)); while(cin>>a>>b>>c) { if(a==-1&&b==-1&&c==-1)break; printf("w(%d, %d, %d) = %d\n",a,b,c,recur(a,b,c)); } }
相关文章推荐
- CSU-ACM2017暑期训练3-递推与递归 D-Function Run Fun POJ-1579
- CSU-ACM2017暑期训练3-递推与递归I - Erratic Expansion UVA - 12627
- CSU-ACM2017暑期训练3-递推与递归 G - 展开字符串 HDU - 1274
- CSU-ACM2017暑期训练3-递推与递归 J - Non-boring sequences
- CSU-ACM2017暑期训练3-递推与递归 H - Race UVA - 12034
- CSU-ACM2017暑期训练3-递推与递归 Erratic Expansion
- CSU-ACM2017暑期训练3-递推与递归 G - 展开字符串 HDU - 1274
- CSU-ACM2017暑期训练10-并查集&&HASH C - 食物链 POJ - 1182 (并查集好题)
- CSU-ACM2017暑期训练5-三分 E - Line belt
- CSU-ACM2017暑期训练7-模拟&&贪心 F - Sokoban
- CSU-ACM2017暑期训练8-动态规划初步 C - Common Subsequence
- CSU-ACM2017暑期训练10-并查集&&HASH F - Flying to the Mars HDU - 1800(字符串hash)
- CSU-ACM2017暑期训练5-三分 E - Line belt HDU - 3400
- POJ1579——Function Run Fun(记忆化递归)
- CSU-ACM2017暑期训练8-动态规划初步 D - Longest Ordered Subsequence
- Train Problem I CSU-ACM2017暑期训练1-Debug与STL
- CSU-ACM2017暑期训练3 J - Non-boring sequences UVA - 1608
- Function Run Fun(递归转递推)
- CSU-ACM2017暑期训练6-bfs I - The Labyrinth CodeForces - 616C
- Function Run Fun hdu1579 递推