标签：
Description
1 2 3 4 5
16 17 18 19 6
15 24 25 20 7
14 23 22 21 8
13 12 11 10 9
Input
Output
Sample Input
5 5 1 2 3 4 5 16 17 18 19 6 15 24 25 20 7 14 23 22 21 8 13 12 11 10 9
Sample Output
25
#include <cstdio> #include <cstdlib> #include <algorithm> #include <cstring> #include <queue> using namespace std; const int maxn = 103; int a[maxn][maxn], R, C, dp[maxn][maxn], b[maxn][maxn]; int xi[] = {1,0,0,-1}; int yi[] = {0,1,-1,0}; int res = -1; int slove(int x, int y) { if(dp[x][y] > 0) return dp[x][y]; for(int i = 0; i < 4; i++) { int nx =x+ xi[i]; int ny =y+ yi[i]; if(nx>=1 && nx<=R && ny>=1 && ny<=C && a[x][y] > a[nx][ny]) { int temp = slove(nx, ny); dp[x][y] = max(dp[x][y], temp + 1); } } return dp[x][y]; } int main() { memset(a, 0, sizeof(a)); scanf("%d%d", &R, &C); for(int i = 1; i <= R; i++) { for(int j = 1; j <= C; j++) { scanf("%d", &a[i][j]); dp[i][j] = 0; } } int now = 0; for(int i = 1; i <= R; i++) { for(int j = 1; j <= C; j++) { res = slove(i,j); now = max(now, res); } } printf("%d\n", now+1); return 0; }
标签：
原文地址：http://www.cnblogs.com/cshg/p/5675063.html
