摘要: 二分图+spfa (代码是别人的) 阅读全文
posted @ 2019-10-21 21:11 DUO_JIaMInG 阅读(97) 评论(0) 推荐(0) 编辑
摘要: 拓扑排序+dfs 很容易发现 对于一个点i 到达它经过的最多的城市数等于前一个节点的数量+1 求出每个点前面最多有多少个点就是答案 阅读全文
posted @ 2019-10-21 16:20 DUO_JIaMInG 阅读(123) 评论(0) 推荐(0) 编辑
摘要: 2019-10-21 yeap!!wooooh!! school's sports day!! I had met my best friend just now. This passed my mind,which said "There isn't time, so brief is life, 阅读全文
posted @ 2019-10-21 10:51 DUO_JIaMInG 阅读(245) 评论(0) 推荐(0) 编辑
摘要: Luogu was update this morning. Congratulations,ccsc! emm...juruoxd 阅读全文
posted @ 2019-10-21 07:45 DUO_JIaMInG 阅读(108) 评论(0) 推荐(0) 编辑