https://blog.youkuaiyun.com/d891320478zh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/d891320478/article/details/71635787https://blog.youkuaiyun.com/d891320478/article/details/71635787d891320478Thu, 11 May 2017 17:24:40 +0800https://blog.youkuaiyun.com/d891320478/article/details/71469309https://blog.youkuaiyun.com/d891320478/article/details/71469309d891320478Tue, 09 May 2017 15:02:32 +0800https://blog.youkuaiyun.com/d891320478/article/details/39647701https://blog.youkuaiyun.com/d891320478/article/details/39647701d891320478Sun, 28 Sep 2014 22:10:43 +0800https://blog.youkuaiyun.com/d891320478/article/details/16981365https://blog.youkuaiyun.com/d891320478/article/details/16981365d891320478Wed, 27 Nov 2013 10:47:42 +0800https://blog.youkuaiyun.com/d891320478/article/details/14151123https://blog.youkuaiyun.com/d891320478/article/details/14151123d891320478Mon, 04 Nov 2013 23:15:09 +0800https://blog.youkuaiyun.com/d891320478/article/details/10230131https://blog.youkuaiyun.com/d891320478/article/details/10230131d891320478Fri, 23 Aug 2013 16:39:51 +0800https://blog.youkuaiyun.com/d891320478/article/details/10191893https://blog.youkuaiyun.com/d891320478/article/details/10191893d891320478Thu, 22 Aug 2013 17:32:26 +0800https://blog.youkuaiyun.com/d891320478/article/details/9768623https://blog.youkuaiyun.com/d891320478/article/details/9768623d891320478Mon, 05 Aug 2013 16:47:23 +0800https://blog.youkuaiyun.com/d891320478/article/details/9634259https://blog.youkuaiyun.com/d891320478/article/details/9634259d891320478Tue, 30 Jul 2013 22:26:00 +0800https://blog.youkuaiyun.com/d891320478/article/details/9241943https://blog.youkuaiyun.com/d891320478/article/details/9241943d891320478Thu, 04 Jul 2013 13:47:13 +0800=Jiro的卡则连边，流量1费用C-J，跑最大费用流直到某一次的增广路的费用为负数时结束。 对于第二种情况，首先Ciel的卡数要大于J]]>https://blog.youkuaiyun.com/d891320478/article/details/9181385https://blog.youkuaiyun.com/d891320478/article/details/9181385d891320478Wed, 26 Jun 2013 20:28:32 +0800https://blog.youkuaiyun.com/d891320478/article/details/8949744https://blog.youkuaiyun.com/d891320478/article/details/8949744d891320478Mon, 20 May 2013 12:49:16 +0800https://blog.youkuaiyun.com/d891320478/article/details/8946482https://blog.youkuaiyun.com/d891320478/article/details/8946482d891320478Sun, 19 May 2013 15:54:26 +0800https://blog.youkuaiyun.com/d891320478/article/details/8801402https://blog.youkuaiyun.com/d891320478/article/details/8801402d891320478Sun, 14 Apr 2013 21:59:46 +0800https://blog.youkuaiyun.com/d891320478/article/details/8745963https://blog.youkuaiyun.com/d891320478/article/details/8745963d891320478Mon, 01 Apr 2013 13:09:59 +0800x HDU4417：给一个数列，查询x在区间l,r上有多少数字 离线树状数组，在线主席树，都可以做到logn复杂度的查询，不过主席树的常数超级大，SPOJ那题打死都是TLE，不能直视~ 树状数组做法是先对所有询问按x从小到大排序，然后把原数列里 代码如下： SPOJ KQUERY int z[NN],a[NN],b[N]]>https://blog.youkuaiyun.com/d891320478/article/details/8704903https://blog.youkuaiyun.com/d891320478/article/details/8704903d891320478Fri, 22 Mar 2013 10:53:37 +0800https://blog.youkuaiyun.com/d891320478/article/details/8648667https://blog.youkuaiyun.com/d891320478/article/details/8648667d891320478Thu, 07 Mar 2013 22:56:13 +0800https://blog.youkuaiyun.com/d891320478/article/details/8648171https://blog.youkuaiyun.com/d891320478/article/details/8648171d891320478Thu, 07 Mar 2013 21:16:40 +0800https://blog.youkuaiyun.com/d891320478/article/details/8493138https://blog.youkuaiyun.com/d891320478/article/details/8493138d891320478Fri, 11 Jan 2013 12:14:06 +0800https://blog.youkuaiyun.com/d891320478/article/details/8483524https://blog.youkuaiyun.com/d891320478/article/details/8483524d891320478Wed, 09 Jan 2013 00:15:31 +0800