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 |
spfa, 至少n*n, 居然C++ 297MS 过了按rank分组从大到小对每个节点spfa,统计rank小于等于当前节点的interesting个数 如果知道某个节点最小距离的有某个上限,那么如果正在处理这个节点的时候最小距离比预估上限还大的时候那就不用着急用当前节点relax。 最小距离的上限可以按rank分组更新 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator