-
Notifications
You must be signed in to change notification settings - Fork 0
/
Down_Stairs.java
62 lines (45 loc) · 1.92 KB
/
Down_Stairs.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Down_Stairs {
public static int[][] resultArr;
public static int[][] pathArr;
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String[] arr = br.readLine().split(" ");
int height = Integer.parseInt(arr[0]);
int width = Integer.parseInt(arr[1]);
initArr(height, width);
for(int i = 0; i < height; i++) {
String[] values = br.readLine().split(" ");
mkArr(values, i);
}
System.out.println(getDpResult(1, 1));
}
public static int getDpResult(int x, int y) {
if(x == resultArr[0].length-1 && y == resultArr.length-1) return 1;
int pathValue = pathArr[y][x];
if(pathValue != -1) return pathValue;
pathArr[y][x] = 0;
int heightValue = resultArr[y][x];
if(y < resultArr.length - 1 && heightValue > resultArr[y+1][x]) pathArr[y][x] += getDpResult(x, y+1);
if(y > 0 && heightValue > resultArr[y-1][x]) pathArr[y][x] += getDpResult(x, y-1);
if(x < resultArr[0].length - 1 && heightValue > resultArr[y][x+1]) pathArr[y][x] += getDpResult(x+1, y);
if(x > 0 && heightValue > resultArr[y][x-1]) pathArr[y][x] += getDpResult(x-1, y);
return pathArr[y][x];
}
public static void initArr(int height, int width) {
resultArr = new int[height + 1][width + 1];
pathArr = new int[height + 1][width + 1];
}
public static void mkArr(String[] arr, int height) {
for(int i = 0; i < arr.length; i++) {
resultArr[height+1][i+1] = Integer.parseInt(arr[i]);
}
for(int i = 0; i < resultArr.length; i++) {
for(int j = 0; j < resultArr[0].length; j++) {
pathArr[i][j] = -1;
}
}
}
}