 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| 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 | |||||||||
Re:改了又改，还是超时，AC的人帮忙看看，哪时出问题了，总超时？In Reply To:改了又改，还是超时，AC的人帮忙看看，哪时出问题了，总超时？ Posted by:ding_d at 2008-06-24 01:03:12 提供两个思路，1 直接用map<int, int>存储电话和该电话出现的次数；2 new一个10000000的数组记录每个数出现的次数。都是1000ms左右，几十ms的办法还没想出来 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
