Submission #1127838

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

const int MOD = 1000000007;
const int dh[] = {1, -1, 0, 0};
const int dw[] = {0, 0, 1, -1};

int H, W;
int a[1000][1000], memo[1000][1000];

int dfs(int h, int w) {
	if (memo[h][w] != 0) return memo[h][w];
	int res = 1;
	for (int i = 0; i < 4; i++) {
		int nh = h + dh[i], nw = w + dw[i];
		if (nh < 0 || nh >= H || nw < 0 || nw >= W) continue;
		if (a[h][w] <= a[nh][nw]) continue;
		(res += dfs(nh, nw)) %= MOD;
	}
	memo[h][w] = res;
	return res;
}

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	cin >> H >> W;
	for (int i = 0; i < H; i++) {
		for (int j = 0; j < W; j++) {
			cin >> a[i][j];
		}
	}

	int ans = 0;
	for (int i = 0; i < H; i++) {
		for (int j = 0; j < W; j++) {
			(ans += dfs(i, j)) %= MOD;
		}
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result