摘要：真他娘的搞不懂cdq分治的顺序问题。但是candy?的博客里提到过，多想想吧…… cpp include include include using namespace std; typedef pair par; int T, n, num[100005], tot; const int mod= 阅读全文

摘要：分治+最短路，很套路的 cpp include include include include include using namespace std; int n, m, ans[100005], px[20005], py[20005], uu, hea[20005], cnt, q, din; 阅读全文

摘要：当年我还没学cdq的时候在luogu上写过树套树的代码orzzz "ref" cpp include include include using namespace std; int n, m, uu, vv, dp[100005], c[100005]; struct Node{ int val, 阅读全文

摘要：刚入门cdq分治（入了吗），再研究研究orz cpp include include include using namespace std; int n, opt, xu, yu, xv, yv, ans[10005], cnt, c[2000005]; struct Node{ int x, y 阅读全文

摘要："ref1" "ref2" "ref3" "ref4" cpp include include include using namespace std; int n, k, c[200005], cnt[200005]; struct Node{ int x, y, z, idx, ans; boo 阅读全文