1.8.1 BFS
Bryce1010_贤哉回也
github: https://github.com/Bryce1010
\n
e-mail: bryceyx@gmail.com
展开
-
2017 ACM-ICPC 亚洲区(南宁赛区)网络赛 Minimum Distance in a Star Graph
In this problem, we will define a graph called star graph, and the question is to find the minimum distance between two given nodes in the star graph. Given an integer nn, an n-dimensionaln−dimen原创 2017-09-24 20:06:41 · 565 阅读 · 0 评论 -
【01BFS+思维】Codeforces Round #516 D. Labyrinth
【01BFS+思维】Codeforces Round #516 D. Labyrinth 题意: 给出一个迷宫,限定能往左走和往右走的次数分为为l,r,上下走不限,迷宫中能走的范围最大时多少格子? 思路: 采用双端队列,BFS的时候优先上下走放在双端队列首部,左右走放在队列尾部,这样可以保证走的方法最优。 #include<bits/stdc++.h> using namespace ...原创 2018-10-16 00:35:00 · 275 阅读 · 0 评论