POJ 2312 Battle City(优先队列+BFS)

The input consists of several test cases. The first line of each test case contains two integers M and N (2 <= M, N <= 300). Each of the following M lines contains N uppercase letters, each of which is one of ‘Y’ (you), ‘T’ (target), ‘S’ (steel wall), ‘B’ (brick wall), ‘R’ (river) and ‘E’ (empty space). Both ‘Y’ and ‘T’ appear only once. A test case of M = N = 0 indicates the end of input, and should not be processed.

,就看你能不能战胜它。战胜了,你就是英雄,就是生活的强者。

POJ 2312 Battle City(优先队列+BFS)

相关文章:

你感兴趣的文章:

标签云: