 |
| ||||
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 | |||||||||
呃，不过说起来，这个题貌似还可以卡空间，因为后来想通了，其实可以不用二维数组In Reply To:Re:做N次最短路，然后O(NQ)查询需要注意的地方 Posted by:shahdza at 2012-05-10 10:13:46 先把问题读进来，然后每枚举一个最高消费点做一次最短路后，就for(q)一下更新一遍所有的询问，这样就不用开二维数组了。 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
