POJ1664 记忆递归

import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;

public class DivideApple {

static int m;
static int n;
static int sum;
static int[] plates;
static long[][][] results;

public static void main(String[] args) throws FileNotFoundException {
    // TODO Auto-generated method stub
    results = new long[2001][11][2];
    Scanner sc = new Scanner(System.in);
    sc = new Scanner(new File("files/apple"));
    int T = sc.nextInt();
    for (int t = 0; t < T; t++) {
        m = sc.nextInt();
        n = sc.nextInt();
        sum = 0;
        plates = new int[n + 1];
        System.out.println(DFS(m, n));
    }
}

private static long DFS(int m2, int n2) {
    // TODO Auto-generated method stub
    if (m2 > 0 && results[m2][n2][0] == 1)
        return results[m2][n2][1];
    if (m2 < 0)
        return 0;
    if (m2 == 0 || n2 == 1)
        return 1;
    results[m2][n2][1] = DFS(m2 - n2, n2) + DFS(m2, n2 - 1);
    results[m2][n2][0] = 1;
    return results[m2][n2][1];

}

}