 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
直接floodfill的复杂度比并查集少一个反阿克曼函数呢……而且常数也小，代码还好写……In Reply To:Re:其实，用并查集做也不错。效率高，内存少。简单。 Posted by:0943047777 at 2011-04-12 22:30:37 > 汗。 > dfs搜索尽然0MS。代码也才700+bytes。 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
