https://blog.youkuaiyun.com/HelloWorld10086zh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/HelloWorld10086/article/details/48733373https://blog.youkuaiyun.com/HelloWorld10086/article/details/48733373HelloWorld10086Fri, 25 Sep 2015 15:06:47 +0800 #include #include using namespace std; typedef long long ll; const]]>https://blog.youkuaiyun.com/HelloWorld10086/article/details/48733223https://blog.youkuaiyun.com/HelloWorld10086/article/details/48733223HelloWorld10086Fri, 25 Sep 2015 14:59:25 +0800https://blog.youkuaiyun.com/HelloWorld10086/article/details/48714159https://blog.youkuaiyun.com/HelloWorld10086/article/details/48714159HelloWorld10086Thu, 24 Sep 2015 17:40:56 +0800https://blog.youkuaiyun.com/HelloWorld10086/article/details/48711371https://blog.youkuaiyun.com/HelloWorld10086/article/details/48711371HelloWorld10086Thu, 24 Sep 2015 14:55:44 +0800https://blog.youkuaiyun.com/HelloWorld10086/article/details/48660197https://blog.youkuaiyun.com/HelloWorld10086/article/details/48660197HelloWorld10086Tue, 22 Sep 2015 20:01:11 +0800 v 在生成树上的简单路径上的边权值加一，最后找到所有边权值最小的边，就是属于最小割的边。]]>https://blog.youkuaiyun.com/HelloWorld10086/article/details/48657569https://blog.youkuaiyun.com/HelloWorld10086/article/details/48657569HelloWorld10086Tue, 22 Sep 2015 18:30:26 +0800 #include #include using namespace std; typedef long long ll; const int N = 505; int n, m, q;struct B]]>https://blog.youkuaiyun.com/HelloWorld10086/article/details/48655887https://blog.youkuaiyun.com/HelloWorld10086/article/details/48655887HelloWorld10086Tue, 22 Sep 2015 16:36:20 +0800https://blog.youkuaiyun.com/HelloWorld10086/article/details/48630855https://blog.youkuaiyun.com/HelloWorld10086/article/details/48630855HelloWorld10086Mon, 21 Sep 2015 19:00:37 +0800https://blog.youkuaiyun.com/HelloWorld10086/article/details/48572959https://blog.youkuaiyun.com/HelloWorld10086/article/details/48572959HelloWorld10086Sat, 19 Sep 2015 10:17:56 +0800https://blog.youkuaiyun.com/HelloWorld10086/article/details/48496691https://blog.youkuaiyun.com/HelloWorld10086/article/details/48496691HelloWorld10086Wed, 16 Sep 2015 16:55:25 +08000)，左边界，右边界，以及掉落在它上面，获得多少生命值，一个人从最高的木板开始往下跳，初始时生命值为100，问最后掉落到地面能获得的生命值最多为多少（如果途中生命值为≤0，那么这个人会死去），如果无法跳到地面，输出-1。 解析： 既然只能垂直下落，而且是落在最近的板上，]]>https://blog.youkuaiyun.com/HelloWorld10086/article/details/48496197https://blog.youkuaiyun.com/HelloWorld10086/article/details/48496197HelloWorld10086Wed, 16 Sep 2015 16:32:07 +0800 #include #include #include ]]>https://blog.youkuaiyun.com/HelloWorld10086/article/details/48494613https://blog.youkuaiyun.com/HelloWorld10086/article/details/48494613HelloWorld10086Wed, 16 Sep 2015 15:19:04 +0800https://blog.youkuaiyun.com/HelloWorld10086/article/details/48494341https://blog.youkuaiyun.com/HelloWorld10086/article/details/48494341HelloWorld10086Wed, 16 Sep 2015 15:04:46 +0800https://blog.youkuaiyun.com/HelloWorld10086/article/details/48494035https://blog.youkuaiyun.com/HelloWorld10086/article/details/48494035HelloWorld10086Wed, 16 Sep 2015 14:50:13 +0800 #include #include #include using namespace std; cons]]>https://blog.youkuaiyun.com/HelloWorld10086/article/details/48493877https://blog.youkuaiyun.com/HelloWorld10086/article/details/48493877HelloWorld10086Wed, 16 Sep 2015 14:42:59 +0800https://blog.youkuaiyun.com/HelloWorld10086/article/details/48446457https://blog.youkuaiyun.com/HelloWorld10086/article/details/48446457HelloWorld10086Mon, 14 Sep 2015 21:10:18 +0800https://blog.youkuaiyun.com/HelloWorld10086/article/details/48443327https://blog.youkuaiyun.com/HelloWorld10086/article/details/48443327HelloWorld10086Mon, 14 Sep 2015 18:53:41 +0800 #include #include using namespace std; const in]]>https://blog.youkuaiyun.com/HelloWorld10086/article/details/48419321https://blog.youkuaiyun.com/HelloWorld10086/article/details/48419321HelloWorld10086Sun, 13 Sep 2015 20:04:27 +0800https://blog.youkuaiyun.com/HelloWorld10086/article/details/48418267https://blog.youkuaiyun.com/HelloWorld10086/article/details/48418267HelloWorld10086Sun, 13 Sep 2015 19:26:23 +0800https://blog.youkuaiyun.com/HelloWorld10086/article/details/48393841https://blog.youkuaiyun.com/HelloWorld10086/article/details/48393841HelloWorld10086Sat, 12 Sep 2015 14:24:04 +0800 #include #include