 |
| ||||
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 | |||||||||
险过，900多ms,刷不下来。。。基本想法：对每个B，把它当成最小，只需在其他每个集合里面，找比B大，而且P最小的（B，P）；如果有一个集合都比B大，则不存在此路。对每个B重复上述操作，之后对每种情况进行比较，找出最优的。 感触：一开始对所有B排序，时间922MS，去掉排序竟达1000ms(多按了一下submit,980多MS); Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
