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
一个人要滑雪，从高处向低处滑，问最长距离。数据也不大，直接按照每个点搜一次，用bfs，很好实现的，最后找一下最小值，并没有dp的感觉。

#include<cstdio>
#include<cstring>
#include<iostream>
#include<queue>
#include<vector>
#include<algorithm>
#include<string>
using namespace std;
int  dp[105][105], ans, dir[4][2] = { 1, 0, -1, 0, 0, 1, 0, -1 }, r, c;
struct Node{
    int x, y, a;
}node[105][105];
void check(int x, int y)
{
    queue<Node>p;
    p.push(node[x][y]);
    while (p.size())
    {
        Node temp = p.front();
        p.pop();
        for (int i = 0; i < 4; i++)
        {
            int tempx = temp.x + dir[i][0];
            int tempy = temp.y + dir[i][1];
            if (tempx >= 1 && tempx <= r&&tempy >= 1 && tempy <= c)
            {
                if (temp.a>node[tempx][tempy].a)
                {
                    dp[tempx][tempy] = max(dp[tempx][tempy], dp[temp.x][temp.y] + 1);
                    p.push(node[tempx][tempy]);
                }
            }
        }
    }
}
int main()
{
    int i, j, m, n, t;
    string name;
    cin >> t;
    while (t--)
    {
        cin >> name;
        cin >> r >> c;
        memset(dp, 0, sizeof(dp));
        for (i = 1; i <= r;i++)
        for (j = 1; j <= c; j++)
        {
            cin >> node[i][j].a;
            node[i][j].x = i;
            node[i][j].y = j;
        }
        for (i = 1; i <= r;i++)
        for (j = 1; j <= c; j++)
        {
            ans = 0;
            check(i, j);
        }
        for (i = 1; i <= r;i++)
        for (j = 1; j <= c; j++)
            ans = max(ans, dp[i][j]);
        cout << name << ": ";
        cout << ans+1 << endl;
    }
    return 0;
}