发表评论取消回复
相关阅读
相关 POJ 2533 Longest Ordered Subsequence(最长路径 dp)
Longest Ordered Subsequence <table> <tbody> <tr> <td><strong>Time Limit:</stro
相关 POJ 3414 Pots(模拟bfs+路径记录)
题意: 给出两个容积分别为 a 和 b 的pot,按照以下三种操作方式,求出能否在一定步数后,使者两个pot的其中一个的水量为c。 1.FI
相关 poj2251 三维bfs求最短距离
Dungeon Master <table> <tbody> <tr> <td><strong>Time Limit:</strong> 1000
相关 【POJ1383】Labyrinth
Labyrinth <table> <tbody> <tr> <td><strong>Time Limit:</strong> 2000MS</t
相关 POJ 1383 Labyrinth(两次bfs求最长路径)
The northern part of the Pyramid contains a very large and complicated labyrinth. The la
相关 Ural 1033 Labyrinth(bfs)
Administration of the labyrinth has decided to start a new season with new wallpapers. F
相关 dijkstra求最短路径入门 POJ2387
Til the Cows Come Home <table> <tbody> <tr> <td><strong>Time Limit:</strong>&n
相关 Silver Cow Party POJ - 3268 (Dijkstra两次最短路径)
One cow from each of N farms (1 ≤ N ≤ 1000) conveniently numbered 1..N is going to atten
相关 BFS的应用求最短路径
因为在leetcode的卡片上学习队列,才发现,都是BFS应用的题目,队列只是个“辅助”,BFS才是“打野”。好吧,那就先解决BFS。什么是BFS?全称:Breadth F
相关 空间最短路径,BFS(POJ3278)
题目链接:[http://poj.org/problem?id=3278][http_poj.org_problem_id_3278] include <cstdio
还没有评论,来说两句吧...