poj-1579-Function Run Fun(记忆化搜索)

Function Run Fun

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 14824		Accepted: 7666

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.

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

Pacific Northwest 1999

import java.util.Scanner;

public class Main {

	/**
	 * @param args
	 */
	static int[][][] arr=new int[21][21][21];
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner input=new Scanner(System.in);
        while(true){
        	int a=input.nextInt();
        	int b=input.nextInt();
        	int c=input.nextInt();
        	if(a==-1 && b==-1 && c==-1)
        		break;
        	System.out.print("w("+a+", "+b+", "+c+") = ");
        	int res=w(a,b,c);
        	System.out.println(res);
        	
        }//while
	}

	private static int w(int a, int b, int c) {
		// TODO Auto-generated method stub
		if(a<=0 || b<=0 || c<=0)
			return 1;
		if(a>20 || b>20 || c>20)
			return arr[20][20][20]=w(20,20,20);
		if(arr[a][b][c]!=0)
			return arr[a][b][c];//利用数组保存结果，节约时间
		if(a<b && b<c)
			return arr[a][b][c]=w(a,b,c-1)+w(a,b-1,c-1)-w(a,b-1,c);
		return arr[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);
	}

}