Fighting

分寸 , 克制

POJ 1579

水题!

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

题意:
题意什么的,相信你能看懂,已经把函数都写好了,只是要注意的是为了避免重复的调用 ,所以采用记忆化搜索*


import java.util.Scanner;

public class Main{
    private static int x,y,z;
    private static int[][][] dp = new int[100][100][100];
    public static void main(String[] args) {
    Scanner scanner = new Scanner(System.in);
    while (scanner.hasNext()) {
        x = scanner.nextInt();
        y = scanner.nextInt();
        z = scanner.nextInt();
        if (x==-1&&y==-1&&z==-1) 
        break;
        int current = dfs(x, y, z);
        System.out.printf("w(%d, %d, %d) = %d\n",x,y,z,current);
    }
    scanner.close();
    }
    private static int dfs (int a,int b,int c )
    {
    if (a<=0||b<=0||c<=0) 
        return 1;
    if (a>20||b>20||c>20) 
        return dfs(20, 20, 20);
    if (dp[a][b][c]!=0)
        return dp[a][b][c];
    if (a<b&&b<c) 
    dp[a][b][c]=dfs(a, b, c-1)+dfs(a, b-1, c-1)-dfs(a, b-1, c);

    return dp[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);
    }
}
阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/qq_33048603/article/details/51883688
文章标签: poj
个人分类: ACM解题报告
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

不良信息举报

POJ 1579

最多只允许输入30个字

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭