POJ - 2279 Mr.Young's Picture Permutations（dp做法）

题目来源：http://poj.org/problem?id=2279

由于总排数不超过5，且每一排的人数最多为30，可以考虑令f[a1][a2][a3][a4][a5]表示第i排站ai个人的方案数。

边界条件是f[0][0][0][0][0] = 1。

分别考虑依照身高从大到小的顺序向每一排安放，这样每次只能安放在某一排的最后一个位置，而且这一排的人数要少于之前一排的人数。

因此，对于状态f[a1][a2][a3][a4][a5]，其可以更新f[a1+1][a2][a3][a4][a5]，f[a1][a2+1][a3][a4][a5]（满足a2<a1）等。

用C++提交预处理的会MLE。我用Java写的。

代码：

import java.io.*;
import java.lang.*;
import java.lang.reflect.Array;
import java.rmi.*;
import java.util.*;
import java.math.*;

public class Main {

    static StreamTokenizer in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));

    static int nextInt() throws IOException {
        in.nextToken();
        return (int) in.nval;
    }

    static double nextDouble() throws IOException {
        in.nextToken();
        return in.nval;
    }

    static long nextLong() throws IOException {
        in.nextToken();
        return (long) in.nval;
    }

    static String next() throws IOException {
        in.nextToken();
        return in.sval;
    }

    static PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));

    static long f[][][][][];
    static int a[];

    public static void main(String[] args) throws IOException {
        int k;
        a = new int[10];
        while (in.nextToken() != in.TT_EOF) {
            k = (int) in.nval;
            Arrays.fill(a, 0);
            if (k == 0) break;
            for (int i = 1; i <= k; ++i) {
                a[i] = nextInt();
            }
            f = new long[a[1] + 1][a[2] + 1][a[3] + 1][a[4] + 1][a[5] + 1];
            f[0][0][0][0][0] = 1;
            for (int a1 = 0; a1 <= a[1]; ++a1) {
                for (int a2 = 0; a2 <= a[2]; ++a2) {
                    for (int a3 = 0; a3 <= a[3]; ++a3) {
                        for (int a4 = 0; a4 <= a[4]; ++a4) {
                            for (int a5 = 0; a5 <= a[5]; ++a5) {
                                if (a1 + 1 <= a[1]) f[a1 + 1][a2][a3][a4][a5] += f[a1][a2][a3][a4][a5];
                                if (a2 < a1 && a2 + 1 <= a[2]) f[a1][a2 + 1][a3][a4][a5] += f[a1][a2][a3][a4][a5];
                                if (a3 < a2 && a3 + 1 <= a[3]) f[a1][a2][a3 + 1][a4][a5] += f[a1][a2][a3][a4][a5];
                                if (a4 < a3 && a4 + 1 <= a[4]) f[a1][a2][a3][a4 + 1][a5] += f[a1][a2][a3][a4][a5];
                                if (a5 < a4 && a5 + 1 <= a[5]) f[a1][a2][a3][a4][a5 + 1] += f[a1][a2][a3][a4][a5];
                            }
                        }
                    }
                }
            }
            out.println(f[a[1]][a[2]][a[3]][a[4]][a[5]]);
            out.flush();
        }
    }
}