E-COM-NET
首页
在线工具
Layui镜像站
SUI文档
联系我们
推荐频道
Java
PHP
C++
C
C#
Python
Ruby
go语言
Scala
Servlet
Vue
MySQL
NoSQL
Redis
CSS
Oracle
SQL Server
DB2
HBase
Http
HTML5
Spring
Ajax
Jquery
JavaScript
Json
XML
NodeJs
mybatis
Hibernate
算法
设计模式
shell
数据结构
大数据
JS
消息中间件
正则表达式
Tomcat
SQL
Nginx
Shiro
Maven
Linux
ACM-bfs
ACM-bfs
之Find a way——hdu2612
FindawayTimeLimit:3000/1000MS(Java/Others)MemoryLimit:32768/32768K(Java/Others)TotalSubmission(s):3387AcceptedSubmission(s):1104ProblemDescriptionPassayearlearninginHangzhou,yifenfeiarrivalhometownNin
ltree98
·
2020-08-17 13:49
ACM-搜索
漫漫刷题路
ACM-BFS
之Ignatius and the Princess I ——hdu1026
IgnatiusandthePrincessISpecialJudgeProblemDescriptionThePrincesshasbeenabductedbytheBEelzebubfeng5166,ourheroIgnatiushastorescueourprettyPrincess.Nowhegetsintofeng5166'scastle.Thecastleisalargelabyrin
ltree98
·
2020-08-03 19:37
ACM-搜索
漫漫刷题路
ACM-BFS
之Rescue——hdu1242
Rescue题目:http://acm.hdu.edu.cn/showproblem.php?pid=1242ProblemDescriptionAngelwascaughtbytheMOLIGPY!HewasputinprisonbyMoligpy.TheprisonisdescribedasaN*M(N,M#include#includeusingnamespacestd;intn,m,f_x
ltree98
·
2020-07-29 13:14
ACM-搜索
漫漫刷题路
ACM-BFS
之Open the Lock——hdu1195(双向BFS)
这道题的初级版本,暴力BFS及题目详情请戳:http://blog.csdn.net/lttree/article/details/24658031上回书说道,要用双向BFS来尝试一下。终于AC了,双向BFS,就是从两个点寻找一个共同的中间点。然后把各自到这个中间点的步数加起来,及为最短步数。肯定有人问了,双向BFS有啥好处捏?鄙人,有图有真相!单BFS:双向BFS:发现了不?尤其是随着搜索广度的
lx417147512
·
2014-04-29 09:00
Lock
ACM
open
bfs
the
hdu1195
双向BFS
ACM-BFS
之Open the Lock——hdu1195
OpentheLockTimeLimit:2000/1000MS(Java/Others) MemoryLimit:65536/32768K(Java/Others)TotalSubmission(s):3825 AcceptedSubmission(s):1650ProblemDescriptionNowanemergenttaskforyouistoopenapasswordloc
lx417147512
·
2014-04-28 17:00
Lock
ACM
open
bfs
the
hdu1195
暴力广度优先搜索
ACM-BFS
之A计划——hdu2102
A计划题目:http://acm.hdu.edu.cn/showproblem.php?pid=2102TimeLimit:3000/1000MS(Java/Others)MemoryLimit:32768/32768K(Java/Others)TotalSubmission(s):8403AcceptedSubmission(s):1995ProblemDescription可怜的公主在一次次被
lx417147512
·
2014-04-27 19:00
ACM
bfs
A计划
hdu2102
ACM-BFS
之逃离迷宫——hdu1728
逃离迷宫题目:http://acm.hdu.edu.cn/showproblem.php?pid=1728TimeLimit:1000/1000MS(Java/Others)MemoryLimit:32768/32768K(Java/Others)TotalSubmission(s):13583AcceptedSubmission(s):3224ProblemDescription给定一个m×n(
lx417147512
·
2014-04-26 19:00
ACM
bfs
逃离迷宫
hdu1728
ACM-BFS
之Dating with girls(2)——hdu2579
Datingwithgirls(2)题目:http://acm.hdu.edu.cn/showproblem.php?pid=2579TimeLimit:2000/1000MS(Java/Others)MemoryLimit:32768/32768K(Java/Others)TotalSubmission(s):1959AcceptedSubmission(s):551ProblemDescrip
lx417147512
·
2014-04-25 21:00
with
ACM
bfs
Dating
girls2
hdu2579
vis数组变种
ACM-BFS
之非常可乐——hdu1495
非常可乐题目:http://acm.hdu.edu.cn/showproblem.php?pid=1495ProblemDescription大家一定觉的运动以后喝可乐是一件很惬意的事情,但是seeyou却不这么认为。因为每次当seeyou买了可乐以后,阿牛就要求和seeyou一起分享这一瓶可乐,而且一定要喝的和seeyou一样多。但seeyou的手中只有两个杯子,它们的容量分别是N毫升和M毫升可
lx417147512
·
2014-04-19 19:00
ACM
bfs
非常可乐
hdu1495
ACM-BFS
之胜利大逃亡——hdu1253
胜利大逃亡题目:http://acm.hdu.edu.cn/showproblem.php?pid=1253ProblemDescriptionIgnatius被魔王抓走了,有一天魔王出差去了,这可是Ignatius逃亡的好机会.魔王住在一个城堡里,城堡是一个A*B*C的立方体,可以被表示成A个B*C的矩阵,刚开始Ignatius被关在(0,0,0)的位置,离开城堡的门在(A-1,B-1,C-1)
lx417147512
·
2014-04-06 21:00
ACM
bfs
胜利大逃亡
hdu1253
ACM-BFS
之Catch That Cow——hdu2717
CatchThatCow题目:http://acm.hdu.edu.cn/showproblem.php?pid=2717ProblemDescriptionFarmerJohnhasbeeninformedofthelocationofafugitivecowandwantstocatchherimmediately.HestartsatapointN(0≤N≤100,000)onanumber
lx417147512
·
2014-04-05 21:00
ACM
catch
bfs
COW
that
hdu2717
ACM-BFS
之Nightmare——hdu1072
Nightmare题目:http://acm.hdu.edu.cn/showproblem.php?pid=1072ProblemDescriptionIgnatiushadanightmarelastnight.Hefoundhimselfinalabyrinthwithatimebombonhim.Thelabyrinthhasanexit,Ignatiusshouldgetoutofthel
lx417147512
·
2014-04-04 21:00
ACM
bfs
nightmare
hdu1072
ACM-BFS
之A strange lift——hdu1548
Astrangelift题目:http://acm.hdu.edu.cn/showproblem.php?pid=1548ProblemDescriptionThereisastrangelift.Theliftcanstopcanateveryfloorasyouwant,andthereisanumberKi(0 #include #include usingnamespacestd; //s
lx417147512
·
2014-04-04 12:00
ACM
bfs
lift
a
strange
hdu1548
ACM-bfs
之Find a way——hdu2612
FindawayTimeLimit:3000/1000MS(Java/Others)MemoryLimit:32768/32768K(Java/Others)TotalSubmission(s):3387AcceptedSubmission(s):1104ProblemDescriptionPassayearlearninginHangzhou,yifenfeiarrivalhometownNin
lx417147512
·
2014-03-03 16:00
Way
ACM
find
bfs
a
hdu2612
ACM-BFS
之Ignatius and the Princess I ——hdu1026
IgnatiusandthePrincessISpecialJudgeProblemDescriptionThePrincesshasbeenabductedbytheBEelzebubfeng5166,ourheroIgnatiushastorescueourprettyPrincess.Nowhegetsintofeng5166'scastle.Thecastleisalargelabyrin
lx417147512
·
2014-02-26 09:00
ACM
bfs
and
the
PRI
Ignatius
hdu1026
ACM-BFS
之knight moves——hdu1327
KnightMovesProblemDescriptionAfriendofyouisdoingresearchontheTravelingKnightProblem(TKP)whereyouaretofindtheshortestclosedtourofknightmovesthatvisitseachsquareofagivensetofnsquaresonachessboardexactly
lx417147512
·
2014-02-24 21:00
ACM
bfs
Moves
Knight
hdu1327
上一页
1
下一页
按字母分类:
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
其他