https://blog.youkuaiyun.com/leolin_zh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/leolin_/article/details/8019171https://blog.youkuaiyun.com/leolin_/article/details/8019171leolin_Wed, 26 Sep 2012 00:04:30 +0800https://blog.youkuaiyun.com/leolin_/article/details/7632811https://blog.youkuaiyun.com/leolin_/article/details/7632811leolin_Tue, 05 Jun 2012 01:22:19 +0800https://blog.youkuaiyun.com/leolin_/article/details/7444167https://blog.youkuaiyun.com/leolin_/article/details/7444167leolin_Tue, 10 Apr 2012 10:18:50 +0800=K的子串的个数(可重复) 做法：首先最正路的做法就是用后缀数组把两个串链接起来，中间加个没出现过的字符，对新串求heigh数组，我们先对遇到A的可以对前面与B的lcp进行相加，同]]>https://blog.youkuaiyun.com/leolin_/article/details/7441022https://blog.youkuaiyun.com/leolin_/article/details/7441022leolin_Mon, 09 Apr 2012 15:01:19 +0800https://blog.youkuaiyun.com/leolin_/article/details/7434852https://blog.youkuaiyun.com/leolin_/article/details/7434852leolin_Sat, 07 Apr 2012 12:26:33 +0800https://blog.youkuaiyun.com/leolin_/article/details/7430178https://blog.youkuaiyun.com/leolin_/article/details/7430178leolin_Thu, 05 Apr 2012 21:42:29 +0800https://blog.youkuaiyun.com/leolin_/article/details/7429706https://blog.youkuaiyun.com/leolin_/article/details/7429706leolin_Thu, 05 Apr 2012 19:22:26 +0800b){ swap(a,b); } k = b-a; tmp = floor(k*(1.0+sqrt(5.0))/2.0);]]>https://blog.youkuaiyun.com/leolin_/article/details/7428628https://blog.youkuaiyun.com/leolin_/article/details/7428628leolin_Thu, 05 Apr 2012 15:07:53 +0800https://blog.youkuaiyun.com/leolin_/article/details/7422842https://blog.youkuaiyun.com/leolin_/article/details/7422842leolin_Tue, 03 Apr 2012 01:06:49 +0800https://blog.youkuaiyun.com/leolin_/article/details/7419014https://blog.youkuaiyun.com/leolin_/article/details/7419014leolin_Sun, 01 Apr 2012 13:32:48 +0800https://blog.youkuaiyun.com/leolin_/article/details/7412932https://blog.youkuaiyun.com/leolin_/article/details/7412932leolin_Fri, 30 Mar 2012 20:31:05 +0800https://blog.youkuaiyun.com/leolin_/article/details/7410931https://blog.youkuaiyun.com/leolin_/article/details/7410931leolin_Fri, 30 Mar 2012 13:09:18 +0800https://blog.youkuaiyun.com/leolin_/article/details/7408972https://blog.youkuaiyun.com/leolin_/article/details/7408972leolin_Thu, 29 Mar 2012 21:22:36 +08000?1:-1; } double det(double x1,double y1,doubl]]>https://blog.youkuaiyun.com/leolin_/article/details/7405462https://blog.youkuaiyun.com/leolin_/article/details/7405462leolin_Thu, 29 Mar 2012 02:00:09 +08000，ab在ac]]>https://blog.youkuaiyun.com/leolin_/article/details/7389189https://blog.youkuaiyun.com/leolin_/article/details/7389189leolin_Sat, 24 Mar 2012 01:27:17 +0800https://blog.youkuaiyun.com/leolin_/article/details/7374971https://blog.youkuaiyun.com/leolin_/article/details/7374971leolin_Tue, 20 Mar 2012 18:26:30 +0800https://blog.youkuaiyun.com/leolin_/article/details/7362601https://blog.youkuaiyun.com/leolin_/article/details/7362601leolin_Fri, 16 Mar 2012 20:29:18 +0800https://blog.youkuaiyun.com/leolin_/article/details/7355359https://blog.youkuaiyun.com/leolin_/article/details/7355359leolin_Thu, 15 Mar 2012 02:08:31 +0800https://blog.youkuaiyun.com/leolin_/article/details/7354402https://blog.youkuaiyun.com/leolin_/article/details/7354402leolin_Wed, 14 Mar 2012 20:11:34 +0800https://blog.youkuaiyun.com/leolin_/article/details/7354213https://blog.youkuaiyun.com/leolin_/article/details/7354213leolin_Wed, 14 Mar 2012 19:08:40 +0800y或y->x，其实就是求弱连通分量.... 方法：缩点+拓扑。因为环内各点肯定可以任意到达，缩完点后就可能变成树或森林，当树是一条链的时候才存在弱连通分量，拓扑一下就ok... 一开始看不到The cave has n rooms, andone-way cor]]>