【洛谷】P1464 Function*（记忆化搜索）

穿越隧道

输出有坑，ans和前面的部分要分开输出。。。。
奇奇怪怪

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 25;
//将搜索的结果，存起来就是记忆化搜索
//防止重复递归，TLE 
ll path[N][N][N]; 
ll dfs(ll a, ll b, ll c){
	if(a <= 0 || b <= 0 || c <= 0){
		return 1;
	}
	else if(path[a][b][c] != 0) return path[a][b][c];//查表，当表存在该值时，返回 
	else if(a > 20 || b > 20 || c > 20){
		path[a][b][c] =  dfs(20,20,20);
	}
	else if(a < b && b < c){
		path[a][b][c] =  dfs(a,b,c-1) + dfs(a, b-1, c - 1) - dfs(a,b-1,c);
	}
	else{
		path[a][b][c] =  dfs(a - 1, b, c) + dfs(a - 1, b - 1,c) + dfs(a - 1, b, c - 1) - dfs(a - 1,b-1,c-1); 
	}
	return path[a][b][c];
}
int main(){
	ll a,b,c;
	while(cin >> a >> b >> c){
		if(a == -1 && b == -1 && c == -1) break;
		memset(path,0,sizeof(path));
		printf("w(%lld, %lld, %lld) = ",a,b,c);
		if(a > 20) a = 21;
		if(b > 20) b = 21;
		if(c > 20) c = 21;
//		cout <<"a = " << a << "b = " << b <<" c = " << c << endl;
		ll t = dfs(a,b,c);
		printf("%lld\n",t);//?????离谱 
		//如果，像下面写会wa,好怪好怪 
//		printf("w(%lld, %lld, %lld) = %lld\n",a,b,c,t); 
	}
	
	return 0;
}