﻿<?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++博客-Standing on Shoulders of Giants</title><link>http://www.cppblog.com/xichuanglian/</link><description>God  Show me the way</description><language>zh-cn</language><lastBuildDate>Sat, 11 Apr 2026 02:30:56 GMT</lastBuildDate><pubDate>Sat, 11 Apr 2026 02:30:56 GMT</pubDate><ttl>60</ttl><item><title>URAL 1096. Get the right route plate!</title><link>http://www.cppblog.com/xichuanglian/archive/2008/11/12/66699.html</link><dc:creator>Joseph</dc:creator><author>Joseph</author><pubDate>Wed, 12 Nov 2008 03:53:00 GMT</pubDate><guid>http://www.cppblog.com/xichuanglian/archive/2008/11/12/66699.html</guid><wfw:comment>http://www.cppblog.com/xichuanglian/comments/66699.html</wfw:comment><comments>http://www.cppblog.com/xichuanglian/archive/2008/11/12/66699.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/xichuanglian/comments/commentRss/66699.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/xichuanglian/services/trackbacks/66699.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: BFS&nbsp;&nbsp;<a href='http://www.cppblog.com/xichuanglian/archive/2008/11/12/66699.html'>阅读全文</a><img src ="http://www.cppblog.com/xichuanglian/aggbug/66699.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/xichuanglian/" target="_blank">Joseph</a> 2008-11-12 11:53 <a href="http://www.cppblog.com/xichuanglian/archive/2008/11/12/66699.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>URAL 1080. Map Colouring</title><link>http://www.cppblog.com/xichuanglian/archive/2008/11/12/66698.html</link><dc:creator>Joseph</dc:creator><author>Joseph</author><pubDate>Wed, 12 Nov 2008 03:52:00 GMT</pubDate><guid>http://www.cppblog.com/xichuanglian/archive/2008/11/12/66698.html</guid><wfw:comment>http://www.cppblog.com/xichuanglian/comments/66698.html</wfw:comment><comments>http://www.cppblog.com/xichuanglian/archive/2008/11/12/66698.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/xichuanglian/comments/commentRss/66698.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/xichuanglian/services/trackbacks/66698.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: BFS，确定每个结点的颜色，发生冲突时输出－1&nbsp;&nbsp;<a href='http://www.cppblog.com/xichuanglian/archive/2008/11/12/66698.html'>阅读全文</a><img src ="http://www.cppblog.com/xichuanglian/aggbug/66698.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/xichuanglian/" target="_blank">Joseph</a> 2008-11-12 11:52 <a href="http://www.cppblog.com/xichuanglian/archive/2008/11/12/66698.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>URAL 1078. Segments</title><link>http://www.cppblog.com/xichuanglian/archive/2008/11/12/66697.html</link><dc:creator>Joseph</dc:creator><author>Joseph</author><pubDate>Wed, 12 Nov 2008 03:50:00 GMT</pubDate><guid>http://www.cppblog.com/xichuanglian/archive/2008/11/12/66697.html</guid><wfw:comment>http://www.cppblog.com/xichuanglian/comments/66697.html</wfw:comment><comments>http://www.cppblog.com/xichuanglian/archive/2008/11/12/66697.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/xichuanglian/comments/commentRss/66697.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/xichuanglian/services/trackbacks/66697.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 预处理所有包含关系，记忆化搜索。&nbsp;&nbsp;<a href='http://www.cppblog.com/xichuanglian/archive/2008/11/12/66697.html'>阅读全文</a><img src ="http://www.cppblog.com/xichuanglian/aggbug/66697.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/xichuanglian/" target="_blank">Joseph</a> 2008-11-12 11:50 <a href="http://www.cppblog.com/xichuanglian/archive/2008/11/12/66697.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>URAL 1095. Nikifor 3</title><link>http://www.cppblog.com/xichuanglian/archive/2008/11/11/66620.html</link><dc:creator>Joseph</dc:creator><author>Joseph</author><pubDate>Tue, 11 Nov 2008 09:17:00 GMT</pubDate><guid>http://www.cppblog.com/xichuanglian/archive/2008/11/11/66620.html</guid><wfw:comment>http://www.cppblog.com/xichuanglian/comments/66620.html</wfw:comment><comments>http://www.cppblog.com/xichuanglian/archive/2008/11/11/66620.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/xichuanglian/comments/commentRss/66620.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/xichuanglian/services/trackbacks/66620.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 因为给出的数字中一定包含1，2，3，4，而且1234是7的同余系。在所有的数字中挑出一组1234，以及所有的0，判断剩下的数字除7的余数，在数的末尾添加相应的由1234组成的四位数，再添上0，就AC了。&nbsp;&nbsp;<a href='http://www.cppblog.com/xichuanglian/archive/2008/11/11/66620.html'>阅读全文</a><img src ="http://www.cppblog.com/xichuanglian/aggbug/66620.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/xichuanglian/" target="_blank">Joseph</a> 2008-11-11 17:17 <a href="http://www.cppblog.com/xichuanglian/archive/2008/11/11/66620.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>URAL 1028. Stars</title><link>http://www.cppblog.com/xichuanglian/archive/2008/11/10/66551.html</link><dc:creator>Joseph</dc:creator><author>Joseph</author><pubDate>Mon, 10 Nov 2008 12:38:00 GMT</pubDate><guid>http://www.cppblog.com/xichuanglian/archive/2008/11/10/66551.html</guid><wfw:comment>http://www.cppblog.com/xichuanglian/comments/66551.html</wfw:comment><comments>http://www.cppblog.com/xichuanglian/archive/2008/11/10/66551.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/xichuanglian/comments/commentRss/66551.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/xichuanglian/services/trackbacks/66551.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 又一道树状数组的题。注意坐标值有可能为0，会导致死循环，都加1就可以了。&nbsp;&nbsp;<a href='http://www.cppblog.com/xichuanglian/archive/2008/11/10/66551.html'>阅读全文</a><img src ="http://www.cppblog.com/xichuanglian/aggbug/66551.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/xichuanglian/" target="_blank">Joseph</a> 2008-11-10 20:38 <a href="http://www.cppblog.com/xichuanglian/archive/2008/11/10/66551.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>URAL 1090. In the army now</title><link>http://www.cppblog.com/xichuanglian/archive/2008/11/10/66546.html</link><dc:creator>Joseph</dc:creator><author>Joseph</author><pubDate>Mon, 10 Nov 2008 12:12:00 GMT</pubDate><guid>http://www.cppblog.com/xichuanglian/archive/2008/11/10/66546.html</guid><wfw:comment>http://www.cppblog.com/xichuanglian/comments/66546.html</wfw:comment><comments>http://www.cppblog.com/xichuanglian/archive/2008/11/10/66546.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/xichuanglian/comments/commentRss/66546.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/xichuanglian/services/trackbacks/66546.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 用了树状数组，尽管还不太理解。归并排序统计逆序对个数也可以。&nbsp;&nbsp;<a href='http://www.cppblog.com/xichuanglian/archive/2008/11/10/66546.html'>阅读全文</a><img src ="http://www.cppblog.com/xichuanglian/aggbug/66546.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/xichuanglian/" target="_blank">Joseph</a> 2008-11-10 20:12 <a href="http://www.cppblog.com/xichuanglian/archive/2008/11/10/66546.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>URAL 1085. Meeting</title><link>http://www.cppblog.com/xichuanglian/archive/2008/11/09/66427.html</link><dc:creator>Joseph</dc:creator><author>Joseph</author><pubDate>Sun, 09 Nov 2008 09:27:00 GMT</pubDate><guid>http://www.cppblog.com/xichuanglian/archive/2008/11/09/66427.html</guid><wfw:comment>http://www.cppblog.com/xichuanglian/comments/66427.html</wfw:comment><comments>http://www.cppblog.com/xichuanglian/archive/2008/11/09/66427.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/xichuanglian/comments/commentRss/66427.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/xichuanglian/services/trackbacks/66427.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 将线路和车站都抽象为结点，bfs计算最短路，注意有月票的人携带的钱看作无穷多&nbsp;&nbsp;<a href='http://www.cppblog.com/xichuanglian/archive/2008/11/09/66427.html'>阅读全文</a><img src ="http://www.cppblog.com/xichuanglian/aggbug/66427.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/xichuanglian/" target="_blank">Joseph</a> 2008-11-09 17:27 <a href="http://www.cppblog.com/xichuanglian/archive/2008/11/09/66427.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>URAL 1073. Square country</title><link>http://www.cppblog.com/xichuanglian/archive/2008/11/08/66347.html</link><dc:creator>Joseph</dc:creator><author>Joseph</author><pubDate>Sat, 08 Nov 2008 09:54:00 GMT</pubDate><guid>http://www.cppblog.com/xichuanglian/archive/2008/11/08/66347.html</guid><wfw:comment>http://www.cppblog.com/xichuanglian/comments/66347.html</wfw:comment><comments>http://www.cppblog.com/xichuanglian/archive/2008/11/08/66347.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/xichuanglian/comments/commentRss/66347.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/xichuanglian/services/trackbacks/66347.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 很简单的dp，贪心会WA&nbsp;&nbsp;<a href='http://www.cppblog.com/xichuanglian/archive/2008/11/08/66347.html'>阅读全文</a><img src ="http://www.cppblog.com/xichuanglian/aggbug/66347.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/xichuanglian/" target="_blank">Joseph</a> 2008-11-08 17:54 <a href="http://www.cppblog.com/xichuanglian/archive/2008/11/08/66347.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>URAL 1060. Flip Game</title><link>http://www.cppblog.com/xichuanglian/archive/2008/11/07/66230.html</link><dc:creator>Joseph</dc:creator><author>Joseph</author><pubDate>Fri, 07 Nov 2008 11:21:00 GMT</pubDate><guid>http://www.cppblog.com/xichuanglian/archive/2008/11/07/66230.html</guid><wfw:comment>http://www.cppblog.com/xichuanglian/comments/66230.html</wfw:comment><comments>http://www.cppblog.com/xichuanglian/archive/2008/11/07/66230.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/xichuanglian/comments/commentRss/66230.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/xichuanglian/services/trackbacks/66230.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 枚举对第一行的操作，根据操作后的状态确定之后每一行如何操作，记录最小的操作次数即为答案&nbsp;&nbsp;<a href='http://www.cppblog.com/xichuanglian/archive/2008/11/07/66230.html'>阅读全文</a><img src ="http://www.cppblog.com/xichuanglian/aggbug/66230.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/xichuanglian/" target="_blank">Joseph</a> 2008-11-07 19:21 <a href="http://www.cppblog.com/xichuanglian/archive/2008/11/07/66230.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>URAL 1056. Computer net</title><link>http://www.cppblog.com/xichuanglian/archive/2008/11/07/66225.html</link><dc:creator>Joseph</dc:creator><author>Joseph</author><pubDate>Fri, 07 Nov 2008 09:38:00 GMT</pubDate><guid>http://www.cppblog.com/xichuanglian/archive/2008/11/07/66225.html</guid><wfw:comment>http://www.cppblog.com/xichuanglian/comments/66225.html</wfw:comment><comments>http://www.cppblog.com/xichuanglian/archive/2008/11/07/66225.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/xichuanglian/comments/commentRss/66225.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/xichuanglian/services/trackbacks/66225.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 首先以1号结点为根建树，计算出每个结点的最大深度，再计算每个结点经过父结点路径的最长距离g[i]，g[i]=max(g[father],deep[brother]+2)&nbsp;&nbsp;<a href='http://www.cppblog.com/xichuanglian/archive/2008/11/07/66225.html'>阅读全文</a><img src ="http://www.cppblog.com/xichuanglian/aggbug/66225.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/xichuanglian/" target="_blank">Joseph</a> 2008-11-07 17:38 <a href="http://www.cppblog.com/xichuanglian/archive/2008/11/07/66225.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>