摘要:"传送门" 正反两边dijkstra染色,然后枚举一下边,求出最小值就好啦 代码: c++ include include include include include using namespace std; void read(int &x) { char ch; bool ok; for(o 阅读全文
posted @ 2019-05-04 18:49 蒟蒻--lichenxi 阅读 (29) 评论 (0) 编辑