https://blog.youkuaiyun.com/Loi_ChlorineLightzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/Loi_ChlorineLight/article/details/82962637https://blog.youkuaiyun.com/Loi_ChlorineLight/article/details/82962637Loi_ChlorineLightSun, 07 Oct 2018 23:23:34 +0800https://blog.youkuaiyun.com/Loi_ChlorineLight/article/details/53184872https://blog.youkuaiyun.com/Loi_ChlorineLight/article/details/53184872Loi_ChlorineLightWed, 16 Nov 2016 11:32:02 +0800https://blog.youkuaiyun.com/Loi_ChlorineLight/article/details/53182676https://blog.youkuaiyun.com/Loi_ChlorineLight/article/details/53182676Loi_ChlorineLightWed, 16 Nov 2016 08:09:01 +0800https://blog.youkuaiyun.com/Loi_ChlorineLight/article/details/53182633https://blog.youkuaiyun.com/Loi_ChlorineLight/article/details/53182633Loi_ChlorineLightWed, 16 Nov 2016 07:49:35 +0800https://blog.youkuaiyun.com/Loi_ChlorineLight/article/details/53167552https://blog.youkuaiyun.com/Loi_ChlorineLight/article/details/53167552Loi_ChlorineLightTue, 15 Nov 2016 07:52:03 +0800aj&&i< j则这是一个逆序对。用归并排序合并的时候，如果右边区间的一个元素（称为r）小于左边区间的一个元素（称为l），则左边区间从l往后的所有元素都大于r， 所以r是一定要移动]]>https://blog.youkuaiyun.com/Loi_ChlorineLight/article/details/53164946https://blog.youkuaiyun.com/Loi_ChlorineLight/article/details/53164946Loi_ChlorineLightMon, 14 Nov 2016 21:42:46 +0800https://blog.youkuaiyun.com/Loi_ChlorineLight/article/details/53164783https://blog.youkuaiyun.com/Loi_ChlorineLight/article/details/53164783Loi_ChlorineLightMon, 14 Nov 2016 21:32:23 +0800https://blog.youkuaiyun.com/Loi_ChlorineLight/article/details/53159043https://blog.youkuaiyun.com/Loi_ChlorineLight/article/details/53159043Loi_ChlorineLightMon, 14 Nov 2016 15:01:48 +0800fa->val->max = 1;如果要解读这段代码，我们可以这样： 设置 k 的 fa 的 val]]>https://blog.youkuaiyun.com/Loi_ChlorineLight/article/details/53149985https://blog.youkuaiyun.com/Loi_ChlorineLight/article/details/53149985Loi_ChlorineLightSun, 13 Nov 2016 16:59:55 +0800https://blog.youkuaiyun.com/Loi_ChlorineLight/article/details/53133353https://blog.youkuaiyun.com/Loi_ChlorineLight/article/details/53133353Loi_ChlorineLightFri, 11 Nov 2016 21:25:49 +0800https://blog.youkuaiyun.com/Loi_ChlorineLight/article/details/53121306https://blog.youkuaiyun.com/Loi_ChlorineLight/article/details/53121306Loi_ChlorineLightThu, 10 Nov 2016 20:59:45 +0800https://blog.youkuaiyun.com/Loi_ChlorineLight/article/details/53115102https://blog.youkuaiyun.com/Loi_ChlorineLight/article/details/53115102Loi_ChlorineLightThu, 10 Nov 2016 13:59:59 +0800https://blog.youkuaiyun.com/Loi_ChlorineLight/article/details/53100340https://blog.youkuaiyun.com/Loi_ChlorineLight/article/details/53100340Loi_ChlorineLightWed, 09 Nov 2016 15:24:12 +0800https://blog.youkuaiyun.com/Loi_ChlorineLight/article/details/53100246https://blog.youkuaiyun.com/Loi_ChlorineLight/article/details/53100246Loi_ChlorineLightWed, 09 Nov 2016 15:18:26 +0800https://blog.youkuaiyun.com/Loi_ChlorineLight/article/details/53096277https://blog.youkuaiyun.com/Loi_ChlorineLight/article/details/53096277Loi_ChlorineLightWed, 09 Nov 2016 09:37:54 +0800https://blog.youkuaiyun.com/Loi_ChlorineLight/article/details/53088641https://blog.youkuaiyun.com/Loi_ChlorineLight/article/details/53088641Loi_ChlorineLightTue, 08 Nov 2016 21:26:06 +0800https://blog.youkuaiyun.com/Loi_ChlorineLight/article/details/53081694https://blog.youkuaiyun.com/Loi_ChlorineLight/article/details/53081694Loi_ChlorineLightTue, 08 Nov 2016 14:12:44 +0800https://blog.youkuaiyun.com/Loi_ChlorineLight/article/details/53071844https://blog.youkuaiyun.com/Loi_ChlorineLight/article/details/53071844Loi_ChlorineLightMon, 07 Nov 2016 21:17:01 +0800 #include using namespace std; const int maxn=50000; struct Edge { int ff; int to; int d; int next;]]>https://blog.youkuaiyun.com/Loi_ChlorineLight/article/details/53071099https://blog.youkuaiyun.com/Loi_ChlorineLight/article/details/53071099Loi_ChlorineLightMon, 07 Nov 2016 20:55:17 +0800https://blog.youkuaiyun.com/Loi_ChlorineLight/article/details/53066637https://blog.youkuaiyun.com/Loi_ChlorineLight/article/details/53066637Loi_ChlorineLightMon, 07 Nov 2016 15:25:08 +0800