UVA 10285 Longest Run on a Snowboard
来源:互联网 发布:方舟生存进化低配优化 编辑:程序博客网 时间:2024/06/05 07:45
题目:
J - Longest Run on a Snowboard
Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %llu
Submit Status Practice UVA 10285
Description
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, de ning 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 rst 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, de ning 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
题目大意:
给一个图,求他能单调递减的最大长度.只能上下左右四个方向.
题目思路:
1、如果用搜索,那么很有可能会超时,因为起点和终点都没有指定.
2、我们可以发现,只能从旁边四个方向从高到底,那么我们可以将所有点放入优先队列,取出最高的的点,让他更新四个方向的值,当比v值大,就更新.
3、最后遍历图,寻找最大的记录.
程序:
- uva 10285 Longest Run on a Snowboard
- UVA 10285 Longest Run on a Snowboard
- UVA 10285 - Longest Run on a Snowboard
- UVa 10285 - Longest Run on a Snowboard
- uva 10285 - Longest Run on a Snowboard
- UVa 10285 - Longest Run on a Snowboard
- UVa 10285 - Longest Run on a Snowboard
- UVa 10285 Longest run on a snowboard
- UVA-10285-Longest Run on a Snowboard
- UVa:10285 Longest Run on a Snowboard
- UVA - 10285 Longest Run on a Snowboard
- uva 10285 Longest Run on a Snowboard
- UVA 10285 - Longest Run on a Snowboard
- UVa 10285 - Longest Run on a Snowboard
- UVA - 10285 Longest Run on a Snowboard
- UVA - 10285 Longest Run on a Snowboard
- UVA 10285 Longest Run on a Snowboard
- UVA 10285 Longest Run on a Snowboard
- Linux下编译带x264的ffmpeg的方法
- 第一次写博客
- 9. Palindrome Number 判断数字是否为对称
- ibatis标签
- Mysql性能优化一
- UVA 10285 Longest Run on a Snowboard
- eclipse使用小技巧
- centos7 上mysql的管理
- VoiceOver的使用
- java S2SH项目框架整合搭建实例教程
- fl2440 2.6.35移植触摸屏驱动错误
- web 前端 标签相关
- Enum引发的血案,反思
- localStorage 保存对象Object