摘要:
Time limit: 3.000 seconds限时3.000秒Problem问题Given a graph (V,E) where V is a set of nodes and E is a set of arcs in VxV, and an ordering on the elements... 阅读全文
程序控IPPP (Institute of Penniless Peasent-Programmer) Fellow |