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

这题很别扭

Posted by 11119999 at 2014-02-14 05:12:00 on Problem 1682
通用方法(x个banks)的复杂度是sum^3, sum是x个bank上的clan总数。但是系数大了一点(18,000,000)所以会TLE。max(n, m, k)^3的方法很局限因为当bank很多时,枚举很复杂。但是当只有3个bank的时候既不太难枚举又能降低复杂度系数。挺别扭的一个题,不过也挺有启发。

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