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 |
题是好题,但数据出的不好,内含分析显然按照题意,一个数据最差需要跑1e5次,也就是说最坏情况,复杂度是O(n*q)的,但实际数据中绝大多数的询问,差值都为0,而且不知为何跑的飞快无比,原因不详。难道还有别的做法? Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator