Submission #2532197

---

Source Code Expand

import java.util.Scanner;

public class Main {

	static final int[] dx = { 1, 0, -1, 0 };
	static final int[] dy = { 0, 1, 0, -1 };
	static final int MOD = 1000000007;

	static int h, w;
	static int[][] a, memo;

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);

		h = sc.nextInt();
		w = sc.nextInt();
		a = new int[h + 2][w + 2];
		for (int y = 1; y <= h; y++) {
			for (int x = 1; x <= w; x++) {
				a[y][x] = sc.nextInt();
			}
		}

		int sum = 0;
		memo = new int[h + 2][w + 2];
		for (int y = 1; y <= h; y++) {
			for (int x = 1; x <= w; x++) {
				sum += dp(y, x);
				sum %= MOD;
			}
		}

		System.out.println(sum);

	}

	static int dp(int y, int x) {
		if (memo[y][x] > 0) return memo[y][x];
		int result = 1;
		for (int i = 0; i < 4; i++) {
			int ny = y + dy[i];
			int nx = x + dx[i];
			if (a[y][x] < a[ny][nx]) result = (result + dp(ny, nx)) % MOD;
		}
		return memo[y][x] = result;
	}

}

Submission Info

Judge Result