poorpool

摘要： "ref" cpp include include include using namespace std; int n, m, a[100005], sum[400005], tag[400005], q; struct Node{ int opt, lll, rrr; }nd[100005]; 阅读全文

摘要： "线段树合并" 好写好调，隔壁老王的treap+启发式合并难写难调 cpp include include using namespace std; int n, m, fa[100005], val[100005], rot[100005], uu, vv, fan[100005], cnt; i 阅读全文

摘要： "ref" 阅读全文

摘要： 学习一发平面图的姿势…… "ref" cpp include include include include include using namespace std; typedef long long ll; int n, m, k, cnt, uu, vv, nxt[1200005], bel[ 阅读全文

摘要： "ref" cpp include include include include include using namespace std; int n, tot, dfn[100005], s[100005][26], dep[100005], idx, siz[100005], ans; boo 阅读全文

摘要： "ref" cpp include include using namespace std; int a[100005], n, l, ans=0x3f3f3f3f; int main(){ cin n l; for(int i=1; i 阅读全文

摘要： 呸，大傻逼题，我更傻逼 "ref" cpp include using namespace std; typedef long long ll; ll n, k, m, d, ans; int main(){ cin n k m d; for(int i=1; i 阅读全文

摘要： "ref" cpp include include include include using namespace std; typedef long long ll; int n, q, a[100005], l[100005], r[100005], sta[100005], din, blc, 阅读全文

摘要： 好像复杂度来说不是正解……不加谜之优化（下叙）能被loj上的加强数据卡 cpp include include include include using namespace std; int n, m, hea[100005], cnt, uu[200005], fa[100005], siz[1 阅读全文

摘要： 这竟然是一道分块题…… cpp include include include include using namespace std; int n, m, q, blc, qnt, fa[50005], mxa[50005], mxb[50005], sz[50005], bcj, ans[500 阅读全文