POJ 1579

记忆化搜索。。。。。

http://poj.org/problem?id=1579

#include <stdio.h>
#define max 32767
int w[21][21][21];
int funtion(int a ,int b ,int c)
{
       if(a <= 0 || b <= 0 || c <= 0) return 1;
       else if(a > 20 || b > 20 || c > 20)
       {
            if(w[20][20][20] == max)
                w[20][20][20] = funtion(20 ,20 ,20);
            return w[20][20][20];
       }
       else if(a < b && b < c)
       {
            if(w[a][b][c - 1] == max) w[a][b][c - 1] = funtion(a ,b ,c - 1);
            if(w[a][b - 1][c - 1] == max) w[a][b - 1][c - 1] = funtion(a ,b - 1 ,c - 1);
            if(w[a][b - 1][c] == max) w[a][b - 1][c] = funtion(a ,b - 1 ,c);
            return w[a][b][c - 1] + w[a][b - 1][c - 1] - w[a][b - 1][c];
       }
       else
       {
            if(w[a - 1][b][c] == max) w[a - 1][b][c] = funtion(a - 1 ,b ,c);
            if(w[a - 1][b - 1][c] == max) w[a - 1][b - 1][c] = funtion(a - 1 ,b - 1 ,c);
            if(w[a - 1][b][c - 1] == max) w[a - 1][b] [c - 1] = funtion(a - 1 ,b ,c - 1);
            if(w[a - 1][b - 1][c - 1] == max) w[a - 1][b - 1][c - 1] = funtion(a - 1 ,b - 1 ,c - 1);
            return 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 a ,b ,c;
      while(scanf("%d %d %d",&a ,&b ,&c) && (a != -1 || b != -1 || c != -1))
      {
            for(int i = 0 ;i <= 20 ;i++)
            for(int j = 0 ;j <= 20 ;j++)
            for(int k = 0 ;k <= 20 ;k++)
            w[i][j][k] = max;
            printf("w(%d, %d, %d) = %d\n" ,a ,b ,c ,funtion(a ,b ,c));
      }
      return 0;
}