摘要:
基环树的直径 转载自LIOI_TEos的题解 #include <bits/stdc++.h> using namespace std; typedef long long ll; const int maxn = 1e6 + 100; const ll mod = 20040820; const 阅读全文
摘要:
A.理想路径 #include <bits/stdc++.h> using namespace std; typedef long long ll; const int maxn = 2003; const ll mod = 20040820; const int INF = 2147483647; 阅读全文