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 |
这题很别扭通用方法(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: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator