摘要:
// 模板题#include const int N = 2e4 + 10; int n, now = 1, head[N], dis[N]; struct Node {int v, w, nxt;} G[N '9') c = gc; while(c >= '0' && c <= '9') x = x * 10 + c - '0', c = gc; return x; }... 阅读全文
摘要:
题面:https://www.luogu.org/problemnew/show/P2634#sub 题解:https://www.zybuluo.com/wsndy-xx/note/1141506 阅读全文
摘要:
题解: https://www.zybuluo.com/wsndy-xx/note/1141296 阅读全文
摘要:
https://www.zybuluo.com/wsndy-xx/note/1140511 阅读全文