历届试题 地宫取宝

本文来自：http://blog.csdn.net/q22232222/article/details/26491559

import java.util.Arrays;
import java.util.Scanner;


public class Main {

	/**
	 * @param args
	 */ 
	static int v[][][][]=new int [52][52][14][14];
	static int a[][];
	static int n,m,k;
	public static void main(String[] args) {
		// TODO Auto-generated method stub

		
		Scanner scan=new Scanner(System.in);
		n=scan.nextInt();
		m=scan.nextInt();
		k=scan.nextInt();
		a=new int[n+1][m+1];
		for(int i=0;i<=51;i++)
		{
			for(int ii=0;ii<=51;ii++)
				for(int iii=0;iii<=13;iii++)
					Arrays.fill(v[i][ii][iii], -1);
		}
		for(int i=1;i<=n;i++)
		{
			for(int j=1;j<=m;j++)
				a[i][j]=scan.nextInt();
		}
		System.out.println(digui(1,1,-1,0));

    }
	static int num=0;
	private static int digui(int i, int j,int max,int value) {
		// TODO Auto-generated method stub
		int kkk=num;
		if(i==n&&j==m)
		{
			if(value==k)
			{
			     num++;
		
			}
			else if(value==k-1)
			{
				if(a[i][j]>max)
					num++;
			}
			return num%1000000007;
		}
		
		if(i==n+1||j==m+1)
			return num%1000000007;
		if(value>k)
			return num%1000000007;
		if(value+(n-i+1)+(m-j)<k)
			return num%1000000007;
		if(v[i][j][max+1][k-value]>=0)
		{
			
			num=(num+v[i][j][max+1][k-value])%1000000007;
			return num%1000000007;
		}
		digui(i+1,j,max,value);
		digui(i,j+1,max,value);
		if(a[i][j]>max)
		{
			digui(i+1,j,a[i][j],value+1);
			digui(i,j+1,a[i][j],value+1);
		}
		
		v[i][j][max+1][k-value]=num-kkk;
		return num%1000000007;
	}
}