F.A.Qs Home ProblemSet Status Ranklist Contest LoginRegister
Notice:1:五月份月赛定于5.27日12:30--17:30,欢迎大家来玩! 2:关于OJ的注册可看https://www.lydsy.com/JudgeOnline/wttl/thread.php?tid=5671
大视野在线测评-欢迎您
[ New Thread ]
Problem 2208 >> dfs
GXZlegend @ 2017-10-31 15:53:41
[ Quote ] [ Edit ] [ Delete ] 1#
这不是O(nm)=O(n^3)的吗?只不过数据太水了..
OwenOwl @ 2017-11-23 21:17:58
[ Quote ] [ Edit ] [ Delete ] 2#
cnlarryzhong是暴力之神!
myjs69 @ 2017-11-25 10:57:41
[ Quote ] [ Edit ] [ Delete ] 3#
cnlarryzhong太神了!!
Azrael_Death @ 2017-11-25 11:19:17
[ Quote ] [ Edit ] [ Delete ] 4#
cnlarryzhong太神了!!
Drench @ 2017-11-26 21:29:06
[ Quote ] [ Edit ] [ Delete ] 5#
@cnlarryzhong 这是O(n^2)?你可能需要学习一下怎么算复杂度2333
gryz2016 @ 2018-05-07 17:25:07
[ Quote ] [ Edit ] [ Delete ] 6#
有n^2条边啊
lzt2002 @ 2018-05-16 17:48:49
[ Quote ] [ Edit ] [ Delete ] 7#
但是对每个点搜一遍,搜的时候每个点最多访问一次,不是O(n^2)的吗
[Top] [Previous Page] [Next Page]

HOME Back