摘要: 题目 "vijos1909" 题解 先从终点反向bfs一遍,找出所有无法到达终点的点,那么这些点的上一个点均不能放入路径中,标记下来,最后从起点bfs满足条件的点,得到最短路径 代码 include include include include include include include in 阅读全文
posted @ 2017-09-22 11:24 XYZinc 阅读(147) 评论(0) 推荐(0)