Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

Re:un,用栈能搞到O(n+m)的复杂度

Posted by Liuzhaoliang at 2014-08-20 12:38:47 on Problem 3044
In Reply To:un,用栈能搞到O(n+m)的复杂度 Posted by:applepi at 2010-10-09 21:21:50
确实是栈啊。。

Followed by:

Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top


All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator