POJ 1579-Function Run Fun(記憶化搜尋-遞迴)
Function Run Fun
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 18930 | Accepted: 9612 |
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 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
Source
題目意思:
給出a,b,c,按以下遞迴方式計算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)
②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)
解題思路:
直接遞迴必然超時,所以一定要記憶化搜尋。
用dp[a][b][c]記錄w(a,b,c)的值,每次判斷一下如果計算過就不再重複計算,注意防止下標越界的問題,要先處理負數再處理大數。
#include <iostream>
#include <cstdio>
#include <cstring>
#include <bitset>
#include <map>
#include <iomanip>
#include <algorithm>
#define MAXN 21
#define INF 0xfffffff
using namespace std;
/*
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)
*/
int dp[MAXN][MAXN][MAXN];
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 dp[20][20][20]=w(20,20,20);//為了防止下標越界(大於20)所以先處理
if(dp[a][b][c]!=0) 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()
{
#ifdef ONLINE_JUDGE
#else
freopen("G:/cbx/read.txt","r",stdin);
//freopen("G:/cbx/out.txt","w",stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
memset(dp,0,sizeof(dp));
int 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;
}
相關文章
- WeetCode3 暴力遞迴->記憶化搜尋->動態規劃遞迴動態規劃
- poj1179 區間dp(記憶化搜尋寫法)有巨坑!
- POJ 2311-Cutting Game(Nim博弈-sg函式/記憶化搜尋)GAM函式
- Codeforces 900D Unusual Sequences:記憶化搜尋
- 小心遞迴中記憶體洩漏遞迴記憶體
- 【資料結構】——搜尋二叉樹的插入,查詢和刪除(遞迴&非遞迴)資料結構二叉樹遞迴
- C - Digital Path 計蒜客 - 42397(dp記憶化搜尋)Git
- Codeforces 148D Bag of mice:概率dp 記憶化搜尋
- codeforces 505C. Mr. Kitayuta, the Treasure Hunter (記憶化搜尋)
- 【簡單搜尋】POJ 2251 Dugeon MasterAST
- POJ 1691 Painting A Board(dfs搜尋)AI
- 組合數的計算(利用楊輝三角/記憶化搜尋)
- ES 筆記十七:結構化搜尋筆記
- 一類適合記憶化搜尋的區間dp
- poj3252 數位dp(所有比n小的二進位制位0的個數不少於1的個數)記憶化搜尋
- POJ 3411 Paid Roads(搜尋的小技巧)AI
- 尾遞迴 - 杜絕記憶體洩漏溢位爆棧遞迴記憶體
- ?30 秒瞭解尾遞迴和尾遞迴優化遞迴優化
- 遞迴尾呼叫優化遞迴優化
- 尾遞迴以及優化遞迴優化
- 【Scala】尾遞迴優化遞迴優化
- 搜尋引擎優化(SEO)優化
- 利用非遞迴演算法來搜尋二叉樹中的某個元素java遞迴演算法二叉樹Java
- Codeforces Round #390 (Div. 2)(A,B,C(記憶化搜尋),D(貪心,優先佇列))佇列
- 遞迴和尾遞迴遞迴
- kingbase SQL最佳化案例 ( union遞迴 改 cte遞迴 )SQL遞迴
- 【記憶優化搜尋/dp】HDU - 6415 - 杭電多校第九場 - Rikka with Nash Equilibrium優化UI
- BZOJ 1048: [HAOI2007]分割矩陣 記憶化搜尋,二維字首和矩陣
- solr搜尋分詞優化Solr分詞優化
- 微信全文搜尋優化之路優化
- 搜尋結果頁優化優化
- Google的個性化搜尋Go
- 折半搜尋學習筆記筆記
- 快速排序【遞迴】【非遞迴】排序遞迴
- BFS廣度優先搜尋(6)--poj3414(基礎題)
- Codeforces Round #689 (Div. 2, based on Zed Code Competition)-B. Find the Spruce(DFS+記憶化搜尋)Zed
- 遞迴優化:尾呼叫和Memoization遞迴優化
- 【Leetcode】1340. Jump Game V 【動態規劃/記憶性搜尋】LeetCodeGAM動態規劃