POJ1088动态规划+递归解题报告

题目链接：摸我

 

看完题目会有一些比较直观的想法，显然是用DP，迭代公式也比较好想，f(i,j) = max{ f(i-1,j), f(i+1,j), f(i,j-1), f(i,j-1) } + 1

在上述公式中要注意的是当且仅当周围的点比当前点小的时候才能列入计算的表达式中。

为了让搜索更为迅速，我给数据增加了边界，并且由于采用了迭代的方式，对DP数组中的数值设置了Unprocessed和Processing两个值，只有未处理的节点才会进行迭代计算。

废话不多说，代码如下：

 

//POJ1088滑雪（动态规划之） #include <iostream> using namespace std; const int RANK = 102; const int MaxHeight = 20000; int maxRoad; int DP[RANK][RANK]; int Data[RANK][RANK]; enum State{UnProcess = -2,Processing}; void Initialize(int r, int c) { //set boundary! for (int i=0;i<=c+1;++i) { DP[i][0] = UnProcess; DP[i][r+1] = UnProcess; Data[i][0] = MaxHeight; Data[i][r+1] = MaxHeight; } for (int i = 0;i<=r+1;++i) { DP[0][i] = UnProcess; DP[c+1][i] = UnProcess; Data[0][i] = MaxHeight; Data[c+1][i] = MaxHeight; } for (int i = 1;i<=c;++i) { for (int j = 1;j<=r;++j) { cin>>Data[i][j]; DP[i][j] = UnProcess; } } } int CaculateOne(int x,int y) { int max = 0; bool flag = false; if(Data[x][y] > Data[x-1][y])//up { if(DP[x-1][y] == UnProcess) DP[x-1][y] = CaculateOne(x-1,y); if(max<DP[x-1][y]) max = DP[x-1][y]; flag = true; } if(Data[x][y] > Data[x+1][y])//down { if(DP[x+1][y] == UnProcess) DP[x+1][y] = CaculateOne(x+1,y); if(max<DP[x+1][y]) max = DP[x+1][y]; flag = true; } if(Data[x][y] > Data[x][y-1])//left { if(DP[x][y-1] == UnProcess) DP[x][y-1] = CaculateOne(x,y-1); if(max<DP[x][y-1]) max = DP[x][y-1]; flag = true; } if(Data[x][y] > Data[x][y+1])//right { if(DP[x][y+1] == UnProcess) DP[x][y+1] = CaculateOne(x,y+1); if(max<DP[x][y+1]) max = DP[x][y+1]; flag = true; } if(flag) return max + 1; else return 1; } int CalculateMaxRoad(int r, int c) { int max = 0; for (int i = 1;i<=c;++i) { for (int j = 1;j<=r;++j) { if(DP[i][j] == UnProcess) { DP[i][j] = Processing; DP[i][j] = CaculateOne(i,j); } if(DP[i][j]>max) max = DP[i][j]; } } return max; } int main() { int r,c; while(cin>>c>>r) { Initialize(r,c); cout<<CalculateMaxRoad(r,c)<<endl; } return 0; }