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.
题目给出了不同条件下的计算公式:显然用递归求解,但是测试数据的时候,会发现,迟迟运行不出来结果。显然会TLE;解决的办法就是在递归的过程中保存计算出来的值,这样在求值时便可直接输出值,有点类似于打表的思想=_=
原题链接:http://acm.hdu.edu.cn/showproblem.php?pid=1579
#include<cstdio>
int dp[50][50][50];
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 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 x,y,z;
while(scanf("%d%d%d",&x,&y,&z)!=EOF)
{
if(x==-1&&y==-1&&z==-1) break;
printf("w(%d, %d, %d) = %d\n",x,y,z,w(x,y,z));
}
return 0;
}