随笔分类 -  图论-tarjan

摘要:Redundant Paths Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 21252 Accepted: 8773 Description In order to get from one of the F (1 <= F 阅读全文
posted @ 2019-11-30 16:35 厂长在线养猪 阅读(128) 评论(0) 推荐(0)
摘要:Network of Schools Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 27846 Accepted: 10960 Description A number of schools are connected to a 阅读全文
posted @ 2019-11-30 14:50 厂长在线养猪 阅读(157) 评论(0) 推荐(0)