![](https://img-blog.csdnimg.cn/20201014180756930.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
bfs
落雪染轻愁
这个作者很懒,什么都没留下…
展开
-
POJ-2251 Dungeon Master
You are trapped in a 3D dungeon and need to find the quickest way out! The dungeon is composed of unit cubes which may or may not be filled with rock.原创 2016-08-04 21:22:44 · 167 阅读 · 0 评论 -
CodeForces-688C.NP-Hard Problem
Recently, Pari and Arya did some research about NP-Hard problems and they found the minimum vertex cover problem very interesting.Suppose the graph G is given. Subset A of its vertices is called a vert原创 2016-08-08 23:03:07 · 439 阅读 · 0 评论