https://blog.youkuaiyun.com/Loi_Meikozh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/Loi_Meiko/article/details/106555534https://blog.youkuaiyun.com/Loi_Meiko/article/details/106555534Loi_MeikoFri, 05 Jun 2020 12:56:48 +0800https://blog.youkuaiyun.com/Loi_Meiko/article/details/96897537https://blog.youkuaiyun.com/Loi_Meiko/article/details/96897537Loi_MeikoSat, 03 Aug 2019 17:40:10 +0800https://blog.youkuaiyun.com/Loi_Meiko/article/details/78485075https://blog.youkuaiyun.com/Loi_Meiko/article/details/78485075Loi_MeikoThu, 09 Nov 2017 07:33:45 +0800 #include #include #include #include #define maxn 101000 using namespace std; typedef long long ll; stack S; queue Q; ll w[maxn],scc[maxn],scc]]>https://blog.youkuaiyun.com/Loi_Meiko/article/details/78333426https://blog.youkuaiyun.com/Loi_Meiko/article/details/78333426Loi_MeikoTue, 24 Oct 2017 19:30:05 +0800https://blog.youkuaiyun.com/Loi_Meiko/article/details/78333218https://blog.youkuaiyun.com/Loi_Meiko/article/details/78333218Loi_MeikoTue, 24 Oct 2017 19:07:11 +0800https://blog.youkuaiyun.com/Loi_Meiko/article/details/78306271https://blog.youkuaiyun.com/Loi_Meiko/article/details/78306271Loi_MeikoSat, 21 Oct 2017 20:53:35 +0800https://blog.youkuaiyun.com/Loi_Meiko/article/details/78254966https://blog.youkuaiyun.com/Loi_Meiko/article/details/78254966Loi_MeikoMon, 16 Oct 2017 21:57:21 +0800https://blog.youkuaiyun.com/Loi_Meiko/article/details/78254741https://blog.youkuaiyun.com/Loi_Meiko/article/details/78254741Loi_MeikoMon, 16 Oct 2017 21:36:59 +0800https://blog.youkuaiyun.com/Loi_Meiko/article/details/77334946https://blog.youkuaiyun.com/Loi_Meiko/article/details/77334946Loi_MeikoThu, 17 Aug 2017 16:36:20 +0800https://blog.youkuaiyun.com/Loi_Meiko/article/details/77334176https://blog.youkuaiyun.com/Loi_Meiko/article/details/77334176Loi_MeikoThu, 17 Aug 2017 15:51:48 +0800https://blog.youkuaiyun.com/Loi_Meiko/article/details/76613423https://blog.youkuaiyun.com/Loi_Meiko/article/details/76613423Loi_MeikoThu, 03 Aug 2017 10:54:20 +0800https://blog.youkuaiyun.com/Loi_Meiko/article/details/53188911https://blog.youkuaiyun.com/Loi_Meiko/article/details/53188911Loi_MeikoWed, 16 Nov 2016 17:27:07 +0800> 1; int a = l,b = mid + 1,c = 1; msort(l,mid); msort(mid + 1,r); while(a <=]]>https://blog.youkuaiyun.com/Loi_Meiko/article/details/53188322https://blog.youkuaiyun.com/Loi_Meiko/article/details/53188322Loi_MeikoWed, 16 Nov 2016 16:49:09 +0800 #include using namespace std; int n,num[12]; bool vis[12]; void dfs(int x) { if (x == n) { for(int i = 1; i <= n; i ++) printf("%d ",num[i]);]]>https://blog.youkuaiyun.com/Loi_Meiko/article/details/53188227https://blog.youkuaiyun.com/Loi_Meiko/article/details/53188227Loi_MeikoWed, 16 Nov 2016 16:45:09 +0800 #include #include #include using namespace std; const int MAXN = 50000 + 50; int n, tot = 0, m; int first[MAXN], nxt[MAXN << 1], dis[MAXN], deep[M]]>https://blog.youkuaiyun.com/Loi_Meiko/article/details/53187158https://blog.youkuaiyun.com/Loi_Meiko/article/details/53187158Loi_MeikoWed, 16 Nov 2016 15:37:22 +0800https://blog.youkuaiyun.com/Loi_Meiko/article/details/53178054https://blog.youkuaiyun.com/Loi_Meiko/article/details/53178054Loi_MeikoTue, 15 Nov 2016 21:47:20 +0800https://blog.youkuaiyun.com/Loi_Meiko/article/details/53178013https://blog.youkuaiyun.com/Loi_Meiko/article/details/53178013Loi_MeikoTue, 15 Nov 2016 21:41:26 +0800 #include #include #include using namespace std; const int sz = 200010; int fa[sz]; int n,m; int find(int x) { if(fa[]]>https://blog.youkuaiyun.com/Loi_Meiko/article/details/53177946https://blog.youkuaiyun.com/Loi_Meiko/article/details/53177946Loi_MeikoTue, 15 Nov 2016 21:35:45 +0800https://blog.youkuaiyun.com/Loi_Meiko/article/details/53173153https://blog.youkuaiyun.com/Loi_Meiko/article/details/53173153Loi_MeikoTue, 15 Nov 2016 16:49:05 +0800https://blog.youkuaiyun.com/Loi_Meiko/article/details/53163674https://blog.youkuaiyun.com/Loi_Meiko/article/details/53163674Loi_MeikoMon, 14 Nov 2016 20:09:24 +0800