<![CDATA[AndRing的专栏]]>https://blog.csdn.net/AndRingzh-cnhttps://blog.csdn.net/<![CDATA[【最小点覆盖（树形dp）】PKU-3659-Cell Phone Network]]>https://blog.csdn.net/AndRing/article/details/7471912https://blog.csdn.net/AndRing/article/details/7471912AndRingWed, 18 Apr 2012 02:17:55 +0800<![CDATA[【容斥原理】HDU-1796-How many integers can you find]]>https://blog.csdn.net/AndRing/article/details/7471911https://blog.csdn.net/AndRing/article/details/7471911AndRingWed, 18 Apr 2012 02:05:34 +0800<![CDATA[【二维单调队列】FZU- Problem 2080 最大差值]]>https://blog.csdn.net/AndRing/article/details/7471907https://blog.csdn.net/AndRing/article/details/7471907AndRingWed, 18 Apr 2012 01:56:55 +0800<![CDATA[【数论（扩展的欧几里德）】ZOJ-3593-One Person Game]]>https://blog.csdn.net/AndRing/article/details/7448291https://blog.csdn.net/AndRing/article/details/7448291AndRingWed, 11 Apr 2012 09:56:04 +0800<![CDATA[【dp+数论】PKU-3420-Quad Tiling]]>https://blog.csdn.net/AndRing/article/details/7441046https://blog.csdn.net/AndRing/article/details/7441046AndRingMon, 09 Apr 2012 16:06:28 +0800<![CDATA[【博弈+数论】ZOJ-3591-Nim]]>https://blog.csdn.net/AndRing/article/details/7440933https://blog.csdn.net/AndRing/article/details/7440933AndRingMon, 09 Apr 2012 14:52:02 +0800<![CDATA[【数论】HDU-4196-Remoteland]]>https://blog.csdn.net/AndRing/article/details/7426899https://blog.csdn.net/AndRing/article/details/7426899AndRingWed, 04 Apr 2012 23:50:42 +0800<![CDATA[【Floyd求无向图的最小环】PKU-1734-Sightseeing trip]]>https://blog.csdn.net/AndRing/article/details/7420192https://blog.csdn.net/AndRing/article/details/7420192AndRingSun, 01 Apr 2012 18:59:41 +0800<![CDATA[【dp】HUST-1351-Group]]>https://blog.csdn.net/AndRing/article/details/7417842https://blog.csdn.net/AndRing/article/details/7417842AndRingSun, 01 Apr 2012 09:21:36 +0800<![CDATA[【Floyd求最短路+快速幂】PKU-3613-Cow Relays]]>https://blog.csdn.net/AndRing/article/details/7417630https://blog.csdn.net/AndRing/article/details/7417630AndRingSun, 01 Apr 2012 00:15:26 +0800<![CDATA[【矩阵快速幂相乘求Fibonacci 数列】PKU-3070-Fibonacci]]>https://blog.csdn.net/AndRing/article/details/7417604https://blog.csdn.net/AndRing/article/details/7417604AndRingSat, 31 Mar 2012 23:56:55 +0800<![CDATA[【tarjan求双连通分量】PKU-3177&3352]]>https://blog.csdn.net/AndRing/article/details/7413820https://blog.csdn.net/AndRing/article/details/7413820AndRingSat, 31 Mar 2012 02:13:18 +0800<![CDATA[【tarjan求割边】PKU-3694-Network]]>https://blog.csdn.net/AndRing/article/details/7413054https://blog.csdn.net/AndRing/article/details/7413054AndRingSat, 31 Mar 2012 00:27:05 +0800<![CDATA[【tarjan算法求割点】PKU-1523-SPF]]>https://blog.csdn.net/AndRing/article/details/7410965https://blog.csdn.net/AndRing/article/details/7410965AndRingFri, 30 Mar 2012 13:23:10 +0800<![CDATA[【综合图论】PKU-2942-Knights of the Round Table]]>https://blog.csdn.net/AndRing/article/details/7408605https://blog.csdn.net/AndRing/article/details/7408605AndRingThu, 29 Mar 2012 19:58:03 +0800<![CDATA[【计算几何】Codeforces Round #113 (Div. 2)-B. Polygons]]>https://blog.csdn.net/AndRing/article/details/7404647https://blog.csdn.net/AndRing/article/details/7404647AndRingWed, 28 Mar 2012 21:14:53 +0800<![CDATA[【树形dp】PKU-3345-Bribing FIPA]]>https://blog.csdn.net/AndRing/article/details/7396602https://blog.csdn.net/AndRing/article/details/7396602AndRingMon, 26 Mar 2012 20:54:31 +0800<![CDATA[【树形dp】PKU-3107-Godfather]]>https://blog.csdn.net/AndRing/article/details/7387261https://blog.csdn.net/AndRing/article/details/7387261AndRingFri, 23 Mar 2012 14:43:32 +0800<![CDATA[【树形dp】PKU-2486-Apple Tree]]>https://blog.csdn.net/AndRing/article/details/7385540https://blog.csdn.net/AndRing/article/details/7385540AndRingFri, 23 Mar 2012 01:00:09 +0800<![CDATA[【Havel-Hakimi定理】PKU-1659-Frogs' Neighborhood]]>https://blog.csdn.net/AndRing/article/details/7381844https://blog.csdn.net/AndRing/article/details/7381844AndRingThu, 22 Mar 2012 09:36:59 +0800