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

数据规模还可以再大1000倍

Posted by lda at 2008-08-04 03:00:41 on Problem 3363
其实有办法吧时间复杂度编到 O(m*n);
可惜m,n都<=100
就是最简单的枚举,也只要几十毫秒,数据确实太弱了

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