/*
总时间限制: 1000ms 内存限制: 65536kB
描述 作者:1300012964
Michael喜欢滑雪百这并不奇怪, 因为滑雪的确很刺激。可是为了获得速度,滑的区域必须向下倾斜,而且当你滑到坡底,你不得不再次走上坡或者等待升降机来载你。Michael想知道载一个区域中最长的滑坡。区域由一个二维数组给出。数组的每个数字代表点的高度。下面是一个例子
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
一个人可以从某个点滑向上下左右相邻四个点之一,当且仅当高度减小。在上面的例子中,一条可滑行的滑坡为24-17-16-1。当然25-24-23-...-3-2-1更长。事实上,这是最长的一条。
输入
输入的第一行表示区域的行数R和列数C(1 <= R,C <= 100)。下面是R行,每行有C个整数,代表高度h,0<=h<=10000。
输出
输出最长区域的长度。
样例输入
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
样例输出
25
*/
#include<iostream>
#include<cstdio>
using namespace std;
int **snow_Array;
int R,C,iMax = -1;
int **path,**trail;
int dx[] = {-1,0,0,1};
int dy[] = {0,-1,1,0};
int find_path(int x,int y)
{
int temp = 1,t;
trail[x][y] = 1;
for(int i = 0; i < 4; ++i)
{
if(x+dx[i] < 0 || y+dy[i] < 0 || x+dx[i] >= R || y+dy[i] >= C)
continue;
if(snow_Array[x][y] <= snow_Array[x+dx[i]][y+dy[i]])
continue;
if(trail[x+dx[i]][y+dy[i]] == 0)
{
<span style="white-space:pre"> </span>t = find_path(x+dx[i],y+dy[i]) + 1;
trail[x+dx[i]][y+dy[i]] = 1;
}
else
t = path[x+dx[i]][y+dy[i]] + 1;
if(temp < t)
temp = t;
}
path[x][y] = temp;
return temp;
}
int main()
{
scanf("%d%d",&R,&C);
snow_Array = new int*[R];
path = new int* [R];
trail = new int* [R];
for(int i = 0; i < R; ++i)
{
snow_Array[i] = new int[C];
path[i] = new int[C];
memset(path[i],0,sizeof(int)*C);
trail[i] = new int[C];
memset(trail[i],0,sizeof(int)*C);
for(int j = 0; j < C; ++j)
scanf("%d",&snow_Array[i][j]);
}
for(int i = 0; i < R; ++i)
for(int j = 0; j < C; ++j)
if(trail[i][j] == 0)
find_path(i,j);
for(int i = 0; i < R; ++i)
{
for(int j = 0; j < C; ++j)
{
if(iMax < path[i][j])
iMax = path[i][j];
}
}
for(int i = 0; i < R; ++i) //
{
delete [] snow_Array[i];
delete [] path[i];
delete [] trail[i];
}
delete [] snow_Array;
delete [] path;
delete [] trail;
printf("%d\n",iMax);
system("pause");
return 0;
}
/*
思考总结:
1.事实上不需要引进trail,trail的目的是为了记载点(x,y)是否走过,这用path是否为0就可以标记
因为path一旦被修改,则说明(x,y)已经走了
*/
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int **snow_Array;
int R,C,iMax = -1;
int **path;
int dx[] = {-1,0,0,1};
int dy[] = {0,-1,1,0};
int find_path(int x,int y)
{
if(path[x][y])
return path[x][y];
int temp = 1;
/*
看一同学在做四个方向比较时,不用for循环,直接比较x-1,x+1,y-1,y+1,即不用dx[]来表示,
只有四个方向,这样很简洁,思路清晰,eg:
if(x-1>=0 && snow_Array[x][y] > snow_Array[x-1][y])
temp = max(temp,find_path(x-1,y)+1);
if(x+1<R && snow_Array[x][y] > snow_Array[x+1][y])
temp = max(temp,find_path(x+1,y)+1);
if(y-1>=0 && snow_Array[x][y] > snow_Array[x][y-1])
temp = max(temp,find_path(x,y-1)+1);
if(y+1<C && snow_Array[x][y] > snow_Array[x][y+1])
temp = max(temp,find_path(x,y+1)+1);
————————————————————————————————————————————————————————————
而此处的for循环思路也一样
如果点超出边界 和 不满足下一个点高度比这一点小,则continue
用temp与四个方向的比较
注意赋初值temp = 1
*/
for(int i = 0; i < 4; ++i)
{
if(x+dx[i] < 0 || y+dy[i] < 0 || x+dx[i] >= R || y+dy[i] >= C)
continue;
if(snow_Array[x][y] <= snow_Array[x+dx[i]][y+dy[i]])
continue;
if(temp < find_path(x+dx[i],y+dy[i]) + 1)
temp = find_path(x+dx[i],y+dy[i]) + 1;
}
path[x][y] = temp;
return temp;
}
int main()
{
scanf("%d%d",&R,&C);
snow_Array = new int*[R];
path = new int* [R];
for(int i = 0; i < R; ++i)
{
snow_Array[i] = new int[C];
path[i] = new int[C];
memset(path[i],0,sizeof(int)*C);
for(int j = 0; j < C; ++j)
scanf("%d",&snow_Array[i][j]);
}
/*
这一步其实也不需要这么麻烦,因为find_path本来就是计算(x,y)可到达的长度的函数
就不需要在这里再走,这就修改find_path函数,如果(x,y)已走,返回path[x][y];
for(int i = 0; i < R; ++i)
for(int j = 0; j < C; ++j)
if(path[i][j] == 0)
find_path(i,j);
*/
for(int i = 0; i < R; ++i)
{
for(int j = 0; j < C; ++j)
{
if(iMax < find_path(i,j))
iMax = find_path(i,j);
}
}
for(int i = 0; i < R; ++i) //释放内存
{
delete [] snow_Array[i];
delete [] path[i];
}
delete [] snow_Array;
delete [] path;
printf("%d\n",iMax);
system("pause");
return 0;
}