摘要:
真他娘的搞不懂cdq分治的顺序问题。但是candy?的博客里提到过,多想想吧…… cpp include include include using namespace std; typedef pair par; int T, n, num[100005], tot; const int mod= 阅读全文
摘要:
"ref" cpp include include using namespace std; typedef long long ll; int n, a[270005], b[270005], c[270005], rev[270005]; const int mod=998244353, gg= 阅读全文
摘要:
这题和水管局长很像,枚举 a 的边然后维护关于 b 的最小生成树就可以了。 1A呐 _ include include using namespace std; int n, m, val[150005], zdz[150005], ans=0x3f3f3f3f, fa[150005]; i 阅读全文
摘要:
就是用 lct 维护最小生成树 "ref" cpp include include include include using namespace std; typedef pair par; int n, m, q, val[200005], zdz[200005], ans[200005], c 阅读全文