Poj 1579 题解

记忆性搜索，注意判断数组的边界

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
int f[30][30][30],a,b,c;
int ans;
int dfs(int x,int y,int z)
{
  if(x<=0||y<=0||z<=0) return f[0][0][0]=1;
  else if(x>20||y>20||z>20) return f[20][20][20]=dfs(20,20,20);
  else if(f[x][y][z]>0) return f[x][y][z];
  else if(x<y&&y<z) return f[x][y][z]=dfs(x,y,z-1)+dfs(x,y-1,z-1)-dfs(x,y-1,z);
  else return f[x][y][z]=dfs(x-1,y,z)+dfs(x-1,y-1,z)+dfs(x-1,y,z-1)-dfs(x-1,y-1,z-1);
}
void Solve()
{
  memset(f,0,sizeof(f));
  ans=dfs(a,b,c);
}
void Output()
{
  printf("w(%d, %d, %d) = %d\n",a,b,c,ans);
}
int main()
{
  while(scanf("%d%d%d",&a,&b,&c)!=EOF)
  {
    if(a==-1&&b==-1&&c==-1) break;
    Solve();
    Output();
  }
  return 0;
}