https://blog.youkuaiyun.com/yhf_2015zh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/yhf_2015/article/details/62037254https://blog.youkuaiyun.com/yhf_2015/article/details/62037254yhf_2015Thu, 25 Jul 2019 12:44:18 +0800https://blog.youkuaiyun.com/yhf_2015/article/details/53653214https://blog.youkuaiyun.com/yhf_2015/article/details/53653214yhf_2015Thu, 25 Jul 2019 12:40:55 +0800https://blog.youkuaiyun.com/yhf_2015/article/details/53818467https://blog.youkuaiyun.com/yhf_2015/article/details/53818467yhf_2015Thu, 25 Jul 2019 12:37:36 +0800https://blog.youkuaiyun.com/yhf_2015/article/details/88827645https://blog.youkuaiyun.com/yhf_2015/article/details/88827645yhf_2015Tue, 26 Mar 2019 19:10:24 +0800https://blog.youkuaiyun.com/yhf_2015/article/details/53675376https://blog.youkuaiyun.com/yhf_2015/article/details/53675376yhf_2015Sat, 23 Mar 2019 23:42:23 +0800>1) typedef long long ll; const int maxn = 200010; struct Tree{ ll mx; Tree* ch[2]]]>https://blog.youkuaiyun.com/yhf_2015/article/details/53725789https://blog.youkuaiyun.com/yhf_2015/article/details/53725789yhf_2015Sat, 23 Mar 2019 23:41:48 +0800l,b->l)与merge(a->r,b->r)连接成的树 由于a,b两棵树结构相同，上面的过程的正确性是显然的]]>https://blog.youkuaiyun.com/yhf_2015/article/details/84173347https://blog.youkuaiyun.com/yhf_2015/article/details/84173347yhf_2015Sat, 24 Nov 2018 18:45:16 +0800https://blog.youkuaiyun.com/yhf_2015/article/details/83859757https://blog.youkuaiyun.com/yhf_2015/article/details/83859757yhf_2015Sat, 24 Nov 2018 16:51:49 +0800https://blog.youkuaiyun.com/yhf_2015/article/details/70941453https://blog.youkuaiyun.com/yhf_2015/article/details/70941453yhf_2015Fri, 28 Apr 2017 21:50:38 +0800https://blog.youkuaiyun.com/yhf_2015/article/details/70770194https://blog.youkuaiyun.com/yhf_2015/article/details/70770194yhf_2015Wed, 26 Apr 2017 17:09:30 +0800https://blog.youkuaiyun.com/yhf_2015/article/details/70808350https://blog.youkuaiyun.com/yhf_2015/article/details/70808350yhf_2015Wed, 26 Apr 2017 17:07:07 +0800https://blog.youkuaiyun.com/yhf_2015/article/details/53010471https://blog.youkuaiyun.com/yhf_2015/article/details/53010471yhf_2015Wed, 26 Apr 2017 08:34:07 +0800b,A>Ba>b,A>B 因为ax+by=gcd(a,b)ax+by=gcd(a,b)，gcd(a,b)=gcd(b,a%b)gcd(a,b)=]]>https://blog.youkuaiyun.com/yhf_2015/article/details/53674643https://blog.youkuaiyun.com/yhf_2015/article/details/53674643yhf_2015Wed, 26 Apr 2017 08:32:38 +0800>1) using namespace std; const int maxn = 100010;]]>https://blog.youkuaiyun.com/yhf_2015/article/details/53827555https://blog.youkuaiyun.com/yhf_2015/article/details/53827555yhf_2015Wed, 26 Apr 2017 08:28:19 +0800https://blog.youkuaiyun.com/yhf_2015/article/details/53792042https://blog.youkuaiyun.com/yhf_2015/article/details/53792042yhf_2015Wed, 26 Apr 2017 08:24:52 +0800https://blog.youkuaiyun.com/yhf_2015/article/details/53968770https://blog.youkuaiyun.com/yhf_2015/article/details/53968770yhf_2015Wed, 26 Apr 2017 08:23:53 +0800https://blog.youkuaiyun.com/yhf_2015/article/details/53761839https://blog.youkuaiyun.com/yhf_2015/article/details/53761839yhf_2015Wed, 26 Apr 2017 08:23:03 +0800https://blog.youkuaiyun.com/yhf_2015/article/details/53818031https://blog.youkuaiyun.com/yhf_2015/article/details/53818031yhf_2015Wed, 26 Apr 2017 08:21:38 +0800https://blog.youkuaiyun.com/yhf_2015/article/details/53794369https://blog.youkuaiyun.com/yhf_2015/article/details/53794369yhf_2015Wed, 26 Apr 2017 08:20:31 +0800>1) #define lch (now #define rch ((now const int maxn = 30010; const int inf = 2]]>https://blog.youkuaiyun.com/yhf_2015/article/details/53817965https://blog.youkuaiyun.com/yhf_2015/article/details/53817965yhf_2015Wed, 26 Apr 2017 08:19:37 +0800