poj-1088-滑雪

记忆化搜索
 

import java.io.IOException;
import java.util.Scanner;

public class Main {
    public static int[][] arr;
    public static int[][] cache;
    public static int[] dx = {0,1,0,-1};
    public static int[] dy = {1,0,-1,0};
    public static int r;
    public static int c;
    //在(i,j)处最多能滑的距离
    public static int dp(int i, int j) {
        //cache
        if (cache[i][j] > 1){
            return cache[i][j];
        }
        //take a step
        for(int k = 0;k < 4;k ++){
            int x = i + dx[k];
            int y = j + dy[k];
            if(x>=1 && x<=r && y>=1 && y<=c && arr[i][j]>arr[x][y]){
                cache[i][j]=Math.max(cache[i][j],1+dp(x,y));
            }
        }
        return cache[i][j];
    }

    public static void main(String[] args) throws IOException {
        //input init
        Scanner sc = new Scanner(System.in);
        r = sc.nextInt();
        c = sc.nextInt();
        arr = new int[r + 1][c + 1];
        cache = new int[r + 1][c + 1];
        for (int i = 1; i <= r; i++) {
            for (int j = 1; j <= c; j++) {
                arr[i][j] = sc.nextInt();
                cache[i][j] = 1;
            }
        }
        //core logic
        int max = Integer.MIN_VALUE;
        for (int i = 1; i <= r; i++) {
            for(int j = 1;j <= c;j++)
                max = Math.max(max, dp(i, j));
        }
        //output
        System.out.println(max);
    }
}