郑州升达经贸管理学院-17级-孔鑫
郑州升达经贸管理学院-17级-孔鑫
全部文章
深搜
ACM(6)
ACM算法题(26)
AC自动机(2)
DP(9)
JAVA(6)
KMP(10)
二分匹配(3)
划水(3)
博弈(3)
大数(2)
并查集(8)
广搜(4)
散知识(1)
最小生成树(7)
最短路(6)
未归档(51)
蓝桥杯(3)
贪心(3)
归档
标签
去牛客网
登录
/
注册
K.X的博客
瓜子、饮料、矿泉水
全部文章
/ 深搜
(共8篇)
ZOJ-2165——Red and Black
Red and Black There is a rectangular room, covered with square tiles. Each tile is colored either red or blac...
2019-01-17
0
339
HDU - 2553 N皇后问题 (DFS)
N皇后问题 Problem Description 在N*N的方格棋盘放置了N个皇后,使得它们不相互攻击(即任意2个皇后不允许处在同一排,同一列,也不允许处在与棋盘边框成45角的斜线上。 你的任务是,对于给定...
2018-07-21
0
346
HDU - 1198 Farm Irrigation (DFS)
Farm Irrigation Problem Description Benny has a spacious farm land to irrigate. The farm land is a rectangl...
2018-07-20
0
287
HDU-1016 Prime Ring Problem (DFS)
Prime Ring Problem Problem Description A ring is compose of n circles as shown in diagram. Put natural number 1...
2018-07-18
0
273
HDU- 1548 A strange lift (DFS)
A strange lift Problem Description There is a strange lift.The lift can stop can at every floor as y...
2018-07-18
0
537
HDU-1241 Oil Deposits (DFS)
Oil Deposits The GeoSurvComp geologic survey company is responsible for detecting underground oil dep...
2018-07-15
0
257
HDU-1010 Tempter of the Bone (DFS)
Tempter of the Bone The doggie found a bone in an ancient maze, which fascinated him a lot. However, when h...
2018-07-15
0
243
图的遍历——深度优先搜索
图的遍历——深度优先搜索 题目描述 深度优先搜索遍历类似于树的先根遍历,是树的先根遍历的推广。其过程为:假设初始状态是图中所有顶点未曾被访问,则深度优先搜索可以从图中的某个顶点v出发,访问此顶点,然后依次从v的未被访问的邻接点出发深度优先遍历图,直至图中所有和v有路径相通的顶点都被访问到...
2018-05-16
0
383