https://blog.youkuaiyun.com/diary_yangzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/diary_yang/article/details/51869084https://blog.youkuaiyun.com/diary_yang/article/details/51869084diary_yangSat, 09 Jul 2016 22:59:10 +0800https://blog.youkuaiyun.com/diary_yang/article/details/51331100https://blog.youkuaiyun.com/diary_yang/article/details/51331100diary_yangFri, 06 May 2016 14:52:24 +0800https://blog.youkuaiyun.com/diary_yang/article/details/51331505https://blog.youkuaiyun.com/diary_yang/article/details/51331505diary_yangFri, 06 May 2016 14:43:22 +0800https://blog.youkuaiyun.com/diary_yang/article/details/49683185https://blog.youkuaiyun.com/diary_yang/article/details/49683185diary_yangFri, 06 Nov 2015 15:00:52 +0800https://blog.youkuaiyun.com/diary_yang/article/details/16972683https://blog.youkuaiyun.com/diary_yang/article/details/16972683diary_yangTue, 26 Nov 2013 21:33:41 +0800https://blog.youkuaiyun.com/diary_yang/article/details/16972007https://blog.youkuaiyun.com/diary_yang/article/details/16972007diary_yangTue, 26 Nov 2013 21:07:10 +0800https://blog.youkuaiyun.com/diary_yang/article/details/16944541https://blog.youkuaiyun.com/diary_yang/article/details/16944541diary_yangMon, 25 Nov 2013 14:55:26 +0800https://blog.youkuaiyun.com/diary_yang/article/details/16808771https://blog.youkuaiyun.com/diary_yang/article/details/16808771diary_yangMon, 18 Nov 2013 19:19:09 +0800https://blog.youkuaiyun.com/diary_yang/article/details/16368039https://blog.youkuaiyun.com/diary_yang/article/details/16368039diary_yangSun, 17 Nov 2013 10:18:49 +0800= n + 3，那么也就是说，我们总是能轻松的先构造一个n个点n]]>https://blog.youkuaiyun.com/diary_yang/article/details/16340875https://blog.youkuaiyun.com/diary_yang/article/details/16340875diary_yangFri, 15 Nov 2013 15:36:39 +0800https://blog.youkuaiyun.com/diary_yang/article/details/16114109https://blog.youkuaiyun.com/diary_yang/article/details/16114109diary_yangThu, 14 Nov 2013 11:11:30 +0800t的最小费用最大流。如果能漫流，答]]>https://blog.youkuaiyun.com/diary_yang/article/details/16105599https://blog.youkuaiyun.com/diary_yang/article/details/16105599diary_yangWed, 13 Nov 2013 23:02:34 +0800https://blog.youkuaiyun.com/diary_yang/article/details/16011083https://blog.youkuaiyun.com/diary_yang/article/details/16011083diary_yangWed, 13 Nov 2013 20:52:19 +0800H的所有路径中，最小边最大的那条路径的最小边。 只要能发现，最优路径必然是kruskal求得的最大生成树上就一切都好办了。求出MST，然后在线LCA搞就行了。 #include #include #include #include #include #include #include #include #include #include #de]]>https://blog.youkuaiyun.com/diary_yang/article/details/15505089https://blog.youkuaiyun.com/diary_yang/article/details/15505089diary_yangTue, 12 Nov 2013 17:04:56 +0800https://blog.youkuaiyun.com/diary_yang/article/details/15488817https://blog.youkuaiyun.com/diary_yang/article/details/15488817diary_yangMon, 11 Nov 2013 22:50:32 +0800https://blog.youkuaiyun.com/diary_yang/article/details/14456013https://blog.youkuaiyun.com/diary_yang/article/details/14456013diary_yangThu, 07 Nov 2013 18:57:01 +0800y的最小花费，当最小花费不唯一时，求最小变换次数的解。 类似于双调路径的题，用spfa进行状态转移就行了。不过类似于 ×1， +0这种变换是没有意义的，不用加入队列中了。 #include #include #include #include #include #include #define REP(i, n]]>https://blog.youkuaiyun.com/diary_yang/article/details/14455837https://blog.youkuaiyun.com/diary_yang/article/details/14455837diary_yangThu, 07 Nov 2013 18:39:35 +0800t 的最短路。其中每条边不仅有一个边权，还有对应的一个a, b值。从你出发开始，该边将开放a的时间，然后关闭b的时间，然后开。。关。。。 几乎就是裸的最短路了，就是松弛的时候有两种松弛方法，一种是走到点u的时候，能直接走到v；另一种是时间不够，需要等“一段”时间，然后再走到v。 #include #include #include #include #incl]]>https://blog.youkuaiyun.com/diary_yang/article/details/13880547https://blog.youkuaiyun.com/diary_yang/article/details/13880547diary_yangThu, 31 Oct 2013 21:29:00 +0800https://blog.youkuaiyun.com/diary_yang/article/details/13505629https://blog.youkuaiyun.com/diary_yang/article/details/13505629diary_yangTue, 29 Oct 2013 12:16:03 +0800https://blog.youkuaiyun.com/diary_yang/article/details/12946699https://blog.youkuaiyun.com/diary_yang/article/details/12946699diary_yangTue, 22 Oct 2013 13:54:32 +0800