nyoj10skiing

链接  http://acm.nyist.net/JudgeOnline/problem.php?pid=10

这道是动态规划类的题，找一条最长的距离。首先用 con[i][j]存（i，j）点的最长的距离；再查找最大值就可以了；

注意：边界问题;

这道题 要用递归, 递归出口是找到对应坐标的值（或四周都走不通，此时con[i][j]=1；） 

*/ 

#include<stdio.h>

int dp[101][101], con[101][101], row, col; 

int sur[4][2]={ {1, 0 }, {0, 1}, {-1, 0}, {0, -1} };//这是判断x， y的四周 

int limit( int x, int y )//边界 

{

if( x >=0&&x<row&&y>=0&&y<col ) return 1;

return 0;

} 

int search( int x, int y )

{

int i, nx, ny, pre, sum, flag;//flag是标记， pre是（nx， ny）坐标的最大长度；sum是（x， y）周围最长的路径

pre = sum = flag = 0;

if(con[x][y]) return con[x][y];

else

{

for( i = 0; i < 4; i ++ )

{

nx = x+sur[i][0];

ny = y+sur[i][1];

if( limit( nx, ny )&&dp[nx][ny]<dp[x][y] )

{

pre = search(nx, ny );

sum = sum>pre?sum:pre;

flag = 1;

}

}

}

if( flag )

con[x][y] = sum +1;

else

con[x][y] = 1;

return con[x][y];

}

int main()

{

int t, i, j;

scanf( "%d", &t );

while( t -- )

{

scanf( "%d%d", &row, &col );

for( i = 0; i < row; i ++ )

for( j = 0; j < col; j ++ )

{

scanf( "%d", &dp[i][j] );

con[i][j] = 0;

}

int max = 0;

for( i = 0; i < row; i ++ )

for( j = 0; j < col; j ++ )

{

con[i][j] = search(i, j);

max = max > con[i][j]?max:con[i][j];

}

printf( "%d\n", max );

}

}

参考来源： http://www.cnblogs.com/HpuAcmer/archive/2012/04/19/2457460.html