uva285 - Longest Run on a Snowboard（二维最长递增子序列）

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 105;
char name
;
int map

, dp

;
const int dir[4][2] = { { 0, -1 }, { -1, 0 }, { 0, 1 }, { 1, 0 } };
int n, m;

int DP(int i, int j) {
if (dp[i][j] != -1)
return dp[i][j];
dp[i][j] = 1;
for (int k = 0; k < 4; k++) {
int x = i + dir[k][0];
int y = j + dir[k][1];
if (x<1 || x>n || y<1 || y>m)
continue;
if (map[x][y] < map[i][j])
dp[i][j] = max(dp[i][j], DP(x, y) + 1);
}
return dp[i][j];
}
int main() {
int cas;
scanf("%d", &cas);
while (cas--) {
scanf("%s",name);
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
scanf("%d", &map[i][j]);
memset(dp, -1, sizeof(dp));
int maxn = 1;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++)
maxn = max(maxn, DP(i, j));
printf("%s: %d\n", name, maxn);
}
return 0;
}