poj 1088滑雪

///

s思想：递推，将每个点按照高度排起来，然后遍历，判断这个店是不是最后一个点，并且更新他四周的所需要的步数。

///

#include<iostream>

#include<vector>
#include<algorithm>
using namespace std;
const int MAXN = 100;
int ski[MAXN + 1][MAXN + 1];
int result[MAXN + 1][MAXN + 1];
int R,C;
struct skii{
int x;
int y;
int h;
bool operator < ( skii a)
{
return h<a.h;
}
};
vector<skii> skate;


int main(){
cin>>R>>C;
//memset(result,0,sizeof(result));
for(int i = 0;i <= C;i++)
ski[0][i] = 99;
for(int j = 0;j <= R;j++)
ski[j][0] = 99;
for(int i = 1;i <= R;i++)
for(int j = 1;j <= C;j++)
{
cin>>ski[i][j];
result[i][j] = 1;
skii skateTmp;
skateTmp.x = i;
skateTmp.y = j;
skateTmp.h = ski[i][j];
skate.push_back(skateTmp);
}
sort(skate.begin(),skate.end());
vector<skii>::iterator skit;
for(skit = skate.begin();skit != skate.end();skit++)
{
skii skitt = *skit;
int i = skitt.x;
int j = skitt.y;
if(ski[i][j] <= ski[i - 1][j] && ski[i][j] <= ski[i + 1][j] && ski[i][j] <= ski[i][j - 1]&&ski[i][j] <= ski[i][j + 1])
result[i][j] = 1;
if(ski[i][j] < ski[i - 1][j])
{
if(i - 1 !=0)
result[i - 1][j] = max(result[i][j]+1,result[i - 1][j]);
}
if(ski[i][j] < ski[i][j - 1])
{
if(j - 1 != 0)
result[i][j - 1] = max(result[i][j]+1,result[i][j - 1]);
}
if(ski[i][j] < ski[i][j + 1])
result[i][j + 1] = max(result[i][j]+1,result[i][j + 1]);
if(ski[i][j] < ski[i + 1][j])
result[i + 1][j] = max(result[i][j]+1,result[i + 1][j]);
}
int maax = 0;
for(int i = 0;i <= R;i++)
for(int j = 0;j <= C;j++)
{
if(result[i][j] > maax)
maax = result[i][j];
}
cout<<maax<<endl;
return 0;


}