﻿<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/"><channel><title>C++博客-算法学社-随笔分类-经典题目</title><link>http://www.cppblog.com/hanfei19910905/category/19256.html</link><description>記錄難忘的征途</description><language>zh-cn</language><lastBuildDate>Wed, 06 Jun 2012 16:08:14 GMT</lastBuildDate><pubDate>Wed, 06 Jun 2012 16:08:14 GMT</pubDate><ttl>60</ttl><item><title>hdu 1828  线段树求矩形周长并</title><link>http://www.cppblog.com/hanfei19910905/archive/2012/06/04/177524.html</link><dc:creator>西月弦</dc:creator><author>西月弦</author><pubDate>Mon, 04 Jun 2012 12:54:00 GMT</pubDate><guid>http://www.cppblog.com/hanfei19910905/archive/2012/06/04/177524.html</guid><wfw:comment>http://www.cppblog.com/hanfei19910905/comments/177524.html</wfw:comment><comments>http://www.cppblog.com/hanfei19910905/archive/2012/06/04/177524.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/hanfei19910905/comments/commentRss/177524.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/hanfei19910905/services/trackbacks/177524.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要:     给N(N<5000)个矩形，求周长并。&nbsp;&nbsp;<a href='http://www.cppblog.com/hanfei19910905/archive/2012/06/04/177524.html'>阅读全文</a><img src ="http://www.cppblog.com/hanfei19910905/aggbug/177524.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/hanfei19910905/" target="_blank">西月弦</a> 2012-06-04 20:54 <a href="http://www.cppblog.com/hanfei19910905/archive/2012/06/04/177524.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>spoj 375     树链剖分+LCA+RMQ(zkw线段树)</title><link>http://www.cppblog.com/hanfei19910905/archive/2012/05/14/174904.html</link><dc:creator>西月弦</dc:creator><author>西月弦</author><pubDate>Mon, 14 May 2012 14:17:00 GMT</pubDate><guid>http://www.cppblog.com/hanfei19910905/archive/2012/05/14/174904.html</guid><wfw:comment>http://www.cppblog.com/hanfei19910905/comments/174904.html</wfw:comment><comments>http://www.cppblog.com/hanfei19910905/archive/2012/05/14/174904.html#Feedback</comments><slash:comments>2</slash:comments><wfw:commentRss>http://www.cppblog.com/hanfei19910905/comments/commentRss/174904.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/hanfei19910905/services/trackbacks/174904.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要:    在一个点数为N(N<10,000)的带权树上，支持两个操作：1. 改变一个边权 2. 询问u和v之间的路径上的最大边权&nbsp;&nbsp;<a href='http://www.cppblog.com/hanfei19910905/archive/2012/05/14/174904.html'>阅读全文</a><img src ="http://www.cppblog.com/hanfei19910905/aggbug/174904.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/hanfei19910905/" target="_blank">西月弦</a> 2012-05-14 22:17 <a href="http://www.cppblog.com/hanfei19910905/archive/2012/05/14/174904.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>poj 3580    splay(重口味)</title><link>http://www.cppblog.com/hanfei19910905/archive/2012/05/12/174702.html</link><dc:creator>西月弦</dc:creator><author>西月弦</author><pubDate>Sat, 12 May 2012 15:48:00 GMT</pubDate><guid>http://www.cppblog.com/hanfei19910905/archive/2012/05/12/174702.html</guid><wfw:comment>http://www.cppblog.com/hanfei19910905/comments/174702.html</wfw:comment><comments>http://www.cppblog.com/hanfei19910905/archive/2012/05/12/174702.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/hanfei19910905/comments/commentRss/174702.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/hanfei19910905/services/trackbacks/174702.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要:   给一个长度为N(N<10,000)的数列，要求支持6种操作： 1. 将区间[l,r]同时加一个数 2. 将区间[l,r]翻转 3.将区间[l,r]旋转若干次 4. 插入一个数 5. 删除一个数 6.求[l,r]的最小值&nbsp;&nbsp;<a href='http://www.cppblog.com/hanfei19910905/archive/2012/05/12/174702.html'>阅读全文</a><img src ="http://www.cppblog.com/hanfei19910905/aggbug/174702.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/hanfei19910905/" target="_blank">西月弦</a> 2012-05-12 23:48 <a href="http://www.cppblog.com/hanfei19910905/archive/2012/05/12/174702.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>hdu 1542      求矩形并面积   扫描线+线段树 (zkw版)</title><link>http://www.cppblog.com/hanfei19910905/archive/2012/05/08/173998.html</link><dc:creator>西月弦</dc:creator><author>西月弦</author><pubDate>Tue, 08 May 2012 08:49:00 GMT</pubDate><guid>http://www.cppblog.com/hanfei19910905/archive/2012/05/08/173998.html</guid><wfw:comment>http://www.cppblog.com/hanfei19910905/comments/173998.html</wfw:comment><comments>http://www.cppblog.com/hanfei19910905/archive/2012/05/08/173998.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/hanfei19910905/comments/commentRss/173998.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/hanfei19910905/services/trackbacks/173998.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要:     给出很多矩形，求矩形并的面积。&nbsp;&nbsp;<a href='http://www.cppblog.com/hanfei19910905/archive/2012/05/08/173998.html'>阅读全文</a><img src ="http://www.cppblog.com/hanfei19910905/aggbug/173998.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/hanfei19910905/" target="_blank">西月弦</a> 2012-05-08 16:49 <a href="http://www.cppblog.com/hanfei19910905/archive/2012/05/08/173998.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>poj 3225         线段树(zkw版)+ 懒惰标记</title><link>http://www.cppblog.com/hanfei19910905/archive/2012/05/07/173930.html</link><dc:creator>西月弦</dc:creator><author>西月弦</author><pubDate>Mon, 07 May 2012 12:21:00 GMT</pubDate><guid>http://www.cppblog.com/hanfei19910905/archive/2012/05/07/173930.html</guid><wfw:comment>http://www.cppblog.com/hanfei19910905/comments/173930.html</wfw:comment><comments>http://www.cppblog.com/hanfei19910905/archive/2012/05/07/173930.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/hanfei19910905/comments/commentRss/173930.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/hanfei19910905/services/trackbacks/173930.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要:     定义区间的交，并，差操作。假设当前坐标轴区间集合为S(开始为空)，给大量的询问，格式为 命令+区间T，命令'I'代表S = S交T，'U'代表并，D和C代表S=S-T和S=T-S，S代表S=S-T并T-S。输出最后的区间集合S。&nbsp;&nbsp;<a href='http://www.cppblog.com/hanfei19910905/archive/2012/05/07/173930.html'>阅读全文</a><img src ="http://www.cppblog.com/hanfei19910905/aggbug/173930.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/hanfei19910905/" target="_blank">西月弦</a> 2012-05-07 20:21 <a href="http://www.cppblog.com/hanfei19910905/archive/2012/05/07/173930.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>poj 1182     并查集</title><link>http://www.cppblog.com/hanfei19910905/archive/2012/05/06/173795.html</link><dc:creator>西月弦</dc:creator><author>西月弦</author><pubDate>Sat, 05 May 2012 18:28:00 GMT</pubDate><guid>http://www.cppblog.com/hanfei19910905/archive/2012/05/06/173795.html</guid><wfw:comment>http://www.cppblog.com/hanfei19910905/comments/173795.html</wfw:comment><comments>http://www.cppblog.com/hanfei19910905/archive/2012/05/06/173795.html#Feedback</comments><slash:comments>7</slash:comments><wfw:commentRss>http://www.cppblog.com/hanfei19910905/comments/commentRss/173795.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/hanfei19910905/services/trackbacks/173795.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要:     有三个物种 A，B，C，其中A可以吃B，B可以吃C，C可以吃A。 给出N(N<50000)个生物，给出X(X<100000)个定论，请问X个定论中有多少是谎话？&nbsp;&nbsp;<a href='http://www.cppblog.com/hanfei19910905/archive/2012/05/06/173795.html'>阅读全文</a><img src ="http://www.cppblog.com/hanfei19910905/aggbug/173795.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/hanfei19910905/" target="_blank">西月弦</a> 2012-05-06 02:28 <a href="http://www.cppblog.com/hanfei19910905/archive/2012/05/06/173795.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>poj 1061               求模线性方程的最小整数解</title><link>http://www.cppblog.com/hanfei19910905/archive/2012/05/04/173648.html</link><dc:creator>西月弦</dc:creator><author>西月弦</author><pubDate>Fri, 04 May 2012 03:20:00 GMT</pubDate><guid>http://www.cppblog.com/hanfei19910905/archive/2012/05/04/173648.html</guid><wfw:comment>http://www.cppblog.com/hanfei19910905/comments/173648.html</wfw:comment><comments>http://www.cppblog.com/hanfei19910905/archive/2012/05/04/173648.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/hanfei19910905/comments/commentRss/173648.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/hanfei19910905/services/trackbacks/173648.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要:    在一个长度为L的环上的有两点x,y。点A的速度是m，点B的速度是n。请问二者相遇的最小整数时间。保证m,n,x,y,l都是int型正整数。&nbsp;&nbsp;<a href='http://www.cppblog.com/hanfei19910905/archive/2012/05/04/173648.html'>阅读全文</a><img src ="http://www.cppblog.com/hanfei19910905/aggbug/173648.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/hanfei19910905/" target="_blank">西月弦</a> 2012-05-04 11:20 <a href="http://www.cppblog.com/hanfei19910905/archive/2012/05/04/173648.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>poj 2528        线段树+离散化</title><link>http://www.cppblog.com/hanfei19910905/archive/2012/05/03/173598.html</link><dc:creator>西月弦</dc:creator><author>西月弦</author><pubDate>Thu, 03 May 2012 11:21:00 GMT</pubDate><guid>http://www.cppblog.com/hanfei19910905/archive/2012/05/03/173598.html</guid><wfw:comment>http://www.cppblog.com/hanfei19910905/comments/173598.html</wfw:comment><comments>http://www.cppblog.com/hanfei19910905/archive/2012/05/03/173598.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/hanfei19910905/comments/commentRss/173598.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/hanfei19910905/services/trackbacks/173598.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: N(N<10000)多线段[l,r](1<=l<=r<=1,000,000,000)相互覆盖，每个线段颜色不同，请问最后有多少种颜色?&nbsp;&nbsp;<a href='http://www.cppblog.com/hanfei19910905/archive/2012/05/03/173598.html'>阅读全文</a><img src ="http://www.cppblog.com/hanfei19910905/aggbug/173598.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/hanfei19910905/" target="_blank">西月弦</a> 2012-05-03 19:21 <a href="http://www.cppblog.com/hanfei19910905/archive/2012/05/03/173598.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>hdu 3068      Manacher算法</title><link>http://www.cppblog.com/hanfei19910905/archive/2012/05/02/173526.html</link><dc:creator>西月弦</dc:creator><author>西月弦</author><pubDate>Wed, 02 May 2012 13:26:00 GMT</pubDate><guid>http://www.cppblog.com/hanfei19910905/archive/2012/05/02/173526.html</guid><wfw:comment>http://www.cppblog.com/hanfei19910905/comments/173526.html</wfw:comment><comments>http://www.cppblog.com/hanfei19910905/archive/2012/05/02/173526.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/hanfei19910905/comments/commentRss/173526.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/hanfei19910905/services/trackbacks/173526.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 求一个字符串的最长回文串。串长度小于110,000。&nbsp;&nbsp;<a href='http://www.cppblog.com/hanfei19910905/archive/2012/05/02/173526.html'>阅读全文</a><img src ="http://www.cppblog.com/hanfei19910905/aggbug/173526.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/hanfei19910905/" target="_blank">西月弦</a> 2012-05-02 21:26 <a href="http://www.cppblog.com/hanfei19910905/archive/2012/05/02/173526.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>poj 1741       树形DP+分治+排序+容斥原理</title><link>http://www.cppblog.com/hanfei19910905/archive/2012/05/02/173486.html</link><dc:creator>西月弦</dc:creator><author>西月弦</author><pubDate>Wed, 02 May 2012 08:58:00 GMT</pubDate><guid>http://www.cppblog.com/hanfei19910905/archive/2012/05/02/173486.html</guid><wfw:comment>http://www.cppblog.com/hanfei19910905/comments/173486.html</wfw:comment><comments>http://www.cppblog.com/hanfei19910905/archive/2012/05/02/173486.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/hanfei19910905/comments/commentRss/173486.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/hanfei19910905/services/trackbacks/173486.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要:     给你一个N(N<10000)个点的有权树，请问距离不超过K(K<1,000,000,000)的点对有多少个?&nbsp;&nbsp;<a href='http://www.cppblog.com/hanfei19910905/archive/2012/05/02/173486.html'>阅读全文</a><img src ="http://www.cppblog.com/hanfei19910905/aggbug/173486.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/hanfei19910905/" target="_blank">西月弦</a> 2012-05-02 16:58 <a href="http://www.cppblog.com/hanfei19910905/archive/2012/05/02/173486.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>bzoj 1503  平衡树(splay)</title><link>http://www.cppblog.com/hanfei19910905/archive/2012/05/01/173378.html</link><dc:creator>西月弦</dc:creator><author>西月弦</author><pubDate>Tue, 01 May 2012 11:52:00 GMT</pubDate><guid>http://www.cppblog.com/hanfei19910905/archive/2012/05/01/173378.html</guid><wfw:comment>http://www.cppblog.com/hanfei19910905/comments/173378.html</wfw:comment><comments>http://www.cppblog.com/hanfei19910905/archive/2012/05/01/173378.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/hanfei19910905/comments/commentRss/173378.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/hanfei19910905/services/trackbacks/173378.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要:    用一个数据结构来统计员工，有四种操作 1. 加入一个初始工资为A的员工 2. 将所有人工资提高一个数  3. 将所有人工资降低一个数  4. 询问第K多工资的员工是谁。 其间一点某人的工资低于工资下限，就会立刻离开公司...&nbsp;&nbsp;<a href='http://www.cppblog.com/hanfei19910905/archive/2012/05/01/173378.html'>阅读全文</a><img src ="http://www.cppblog.com/hanfei19910905/aggbug/173378.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/hanfei19910905/" target="_blank">西月弦</a> 2012-05-01 19:52 <a href="http://www.cppblog.com/hanfei19910905/archive/2012/05/01/173378.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>