该问题要求检查给定序列是否对应于从顶点1开始的给定树的某个有效BFS遍历。树是一个无向图，其中任意两个顶点之间都恰好有一条简单路径。给定树的节点数和边的细节以及要检查的序列，输出'Yes'如果序列符合BFS，否则输出'No'。
CF1037D Valid BFS?
The BFS algorithm is defined as follows.
- Consider an undirected graph with vertices numbered from 1
to n. Initialize q as a new queue containing only vertex 1, mark the vertex 1
- as used.
- Extract a vertex v
- .
- Print the index of vertex v
- .
- Iterate in arbitrary order through all such vertices u
最低0.47元/天 解锁文章
406
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
