Longest Run on a Snowboard—— DAG动态规划经典题

L - Longest Run on a Snowboard

描述
一道经典的有向无环图题
记忆+深搜，可行。

Michael likes snowboarding. That’s not very surprising, since snowboarding is really great. The bad
thing is that in order to gain speed, the area must slide downwards. Another disadvantage is that when
you’ve reached the bottom of the hill you have to walk up again or wait for the ski-lift.
Michael would like to know how long the longest run in an area is. That area is given by a grid of
numbers, defining the heights at those points. Look at this example:
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
One can slide down from one point to a connected other one if and only if the height decreases. One
point is connected to another if it’s at left, at right, above or below it. In the sample map, a possible
slide would be 24-17-16-1 (start at 24, end at 1). Of course if you would go 25-24-23-. . . -3-2-1, it would
be a much longer run. In fact, it’s the longest possible.
Input
The first line contains the number of test cases N. Each test case starts with a line containing the
name (it’s a single string), the number of rows R and the number of columns C. After that follow R
lines with C numbers each, defining the heights. R and C won’t be bigger than 100, N not bigger than
15 and the heights are always in the range from 0 to 100.
Output
For each test case, print a line containing the name of the area, a colon, a space and the length of the
longest run one can slide down in that area.
Sample Input
2
Feldberg 10 5
56 14 51 58 88
26 94 24 39 41
24 16 8 51 51
76 72 77 43 10
38 50 59 84 81
5 23 37 71 77
96 10 93 53 82
94 15 96 69 9
74 0 62 38 96
37 54 55 82 38
Spiral 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
Feldberg: 7
Spiral: 25

题目的意思即是，在一个区域内进行滑雪运动。需要我们找到最长的一条滑雪路径，而滑雪过程中，我们要从高处滑向低处。

int M[len][len],dp_map[len][len];//M数组用于存储山峰高度，dp_map数组用于存储到达此处的路径长度
int n,m;//n行，m列
int g[4][2] = {{0,1},{1,0},{0,-1},{-1,0}};//四个方向走

int dfs(int x,int y)
{
    if (dp_map[x][y] != 0)//剪枝
        return dp_map[x][y];

    for (int i=0; i<4; i++)
    {
        int _x = x + g[i][0];
        int _y = y + g[i][1];

        if (_x<1 && _x>m && _y<1 && _y>n)
            continue;

        if (M[x][y] < M[_x][_y])
            dp_map[x][y] = max(dp_map[x][y],dfs(_x,_y)+1);
     	//该点的最大级数（来到这里该走的路长度）应该等于
     	//周围四个点的级数的最大值+1 但注意山峰高度的限制。       
    }
    return dp_map[x][y];
}

int main()
{
    int c;
    string name;

    cin >> c;

    while(c--)
    {
        cin >> name >> n >> m;//n -> height  m->line

        memset(M,0,sizeof(M));
        memset(dp_map,0,sizeof(dp_map));
		//注意数组的初始化
        for (int i=1; i<=n; i++)
            for (int j=1; j<=m; j++)
                cin >> M[i][j];
        int ans = 0;
        for (int i=1; i<=n; i++){
            for (int j=1; j<=m; j++){
                ans = max(ans,dfs(i,j));//找最大级数
            }
        }
        cout << name << ": " << ans+1 << endl;//初始化的基础为0 所以要额外加1
    }
    return 0;
}