![](https://img-blog.csdnimg.cn/20201014180756918.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
搜索
文章平均质量分 77
墨碎江南
这个作者很懒,什么都没留下…
展开
-
Somebody I can kiss CSU - 1119(搜索)
In a maze of r rows and c columns, your task is to collect as many coins as possible. Each square is either your start point “S”(which will become empty after you leave), an empty square “.”, a coin s转载 2017-05-08 15:31:21 · 900 阅读 · 0 评论 -
Children of the Candy Corn POJ 3083(bfs)
The cornfield maze is a popular Halloween treat. Visitors are shown the entrance and must wander through the maze facing zombies, chainsaw-wielding psychopaths, hippies, and other terrors on their ques原创 2017-05-01 16:29:37 · 288 阅读 · 0 评论 -
Stealing Harry Potter's Precious hdu 4771 (搜索)
Harry Potter has some precious. For example, his invisible robe, his wand and his owl. When Hogwarts school is in holiday, Harry Potter has to go back to uncle Vernon’s home. But he can’t bring his pre原创 2017-04-30 15:54:21 · 268 阅读 · 0 评论 -
最短路spfa
spfa可以处理负权回路 什么是负权回路 :如果存在一个环(从某个点出发又回到自己的路径),而且这个环上所有权值之和是负数,那这就是一个负权环,也叫负权回路 如果一条边是负值而且这个图是无向图那么肯定是有负权回路 最小值能在2 3间不断更新 如果一条边是负值但是这个图是有向图 但是可以不断走 1 2 3 来不断更新 但是这个图就没有负权回路 #include #incl原创 2017-04-19 21:13:59 · 292 阅读 · 0 评论 -
ZOJ - 3781 Paint the Grid Reloaded (spfa+bfs+缩点)
Leo has a grid with N rows and M columns. All cells are painted with either black or white initially.Two cells A and B are called connected if they share an edge and they are in the same color, or the...原创 2018-04-25 10:19:28 · 128 阅读 · 0 评论 -
hdu1667-IDA*-迭代加深搜索 A*算法
The rotation game uses a # shaped board, which can hold 24 pieces of square blocks (see Fig.1). The blocks are marked with symbols 1, 2 and 3, with exactly 8 pieces of each kind. Initially, the b...原创 2018-09-10 19:39:33 · 184 阅读 · 0 评论