dfs
文章平均质量分 90
Link_Ray
这个作者很懒,什么都没留下…
展开
-
POJ2488/openjudge 1490 A Knight's Journey 解题报告(dfs)
The knight is getting bored of seeing the same black and white squares again and again and has decided to make a journeyaround the world. Whenever a knight moves, it is two squares in one direction and one squ原创 2017-08-27 13:47:22 · 1269 阅读 · 1 评论 -
POJ1979 /Openjudge1818 Red and Black解题报告(深度优先搜索,图的遍历)
There is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he can move to one of four adjacent tiles. But he can’t move on原创 2017-08-27 12:55:01 · 945 阅读 · 0 评论 -
ZOJ1002 Fire Net DFS(深度优先搜索) 已AC
Fire NetTime Limit: 2 Seconds Memory Limit: 65536 KBSuppose that we have a square city with straight streets. A map of a city is a square board with n rows and n columns, each representin原创 2017-07-29 19:25:10 · 868 阅读 · 0 评论 -
OpenJudge简单的整数划分问题两种方法(DFS)(动态规划0ms),全局题号7215,已AC
描述将正整数n 表示成一系列正整数之和,n=n1+n2+…+nk, 其中n1>=n2>=…>=nk>=1 ,k>=1 。正整数n 的这种表示称为正整数n 的划分。正整数n 的不同的划分个数称为正整数n 的划分数。输入标准的输入包含若干组测试数据。每组测试数据是一个整数N(0 < N <= 50)。输出对于每组测试数据,输出N的划分数。原创 2017-08-01 20:11:59 · 823 阅读 · 0 评论