﻿<?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++博客-Yuan-最新评论</title><link>http://www.cppblog.com/Yuan/CommentsRSS.aspx</link><description /><language>zh-cn</language><pubDate>Tue, 09 Aug 2011 02:32:38 GMT</pubDate><lastBuildDate>Tue, 09 Aug 2011 02:32:38 GMT</lastBuildDate><generator>cnblogs</generator><item><title>re: hdu 3397  线段树  延迟标记的顺序 ★★★★</title><link>http://www.cppblog.com/Yuan/archive/2011/08/09/127892.html#152848</link><dc:creator>_Yuan</dc:creator><author>_Yuan</author><pubDate>Tue, 09 Aug 2011 02:43:00 GMT</pubDate><guid>http://www.cppblog.com/Yuan/archive/2011/08/09/127892.html#152848</guid><description><![CDATA[@好哦<br>我错了<br>求指教<img src ="http://www.cppblog.com/Yuan/aggbug/152848.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/Yuan/" target="_blank">_Yuan</a> 2011-08-09 10:43 <a href="http://www.cppblog.com/Yuan/archive/2011/08/09/127892.html#152848#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: hdu 3397  线段树  延迟标记的顺序 ★★★★</title><link>http://www.cppblog.com/Yuan/archive/2011/08/08/127892.html#152802</link><dc:creator>好哦</dc:creator><author>好哦</author><pubDate>Mon, 08 Aug 2011 09:15:00 GMT</pubDate><guid>http://www.cppblog.com/Yuan/archive/2011/08/08/127892.html#152802</guid><description><![CDATA[不懂线段树以后就别乱发言了<img src ="http://www.cppblog.com/Yuan/aggbug/152802.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/Yuan/" target="_blank">好哦</a> 2011-08-08 17:15 <a href="http://www.cppblog.com/Yuan/archive/2011/08/08/127892.html#152802#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 2-SAT 小结</title><link>http://www.cppblog.com/Yuan/archive/2011/08/07/122209.html#152699</link><dc:creator>QQ438846876 </dc:creator><author>QQ438846876 </author><pubDate>Sun, 07 Aug 2011 01:23:00 GMT</pubDate><guid>http://www.cppblog.com/Yuan/archive/2011/08/07/122209.html#152699</guid><description><![CDATA[o 我2 了。。无视我<img src ="http://www.cppblog.com/Yuan/aggbug/152699.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/Yuan/" target="_blank">QQ438846876 </a> 2011-08-07 09:23 <a href="http://www.cppblog.com/Yuan/archive/2011/08/07/122209.html#152699#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 2-SAT 小结</title><link>http://www.cppblog.com/Yuan/archive/2011/08/07/122209.html#152698</link><dc:creator>QQ438846876 </dc:creator><author>QQ438846876 </author><pubDate>Sun, 07 Aug 2011 01:21:00 GMT</pubDate><guid>http://www.cppblog.com/Yuan/archive/2011/08/07/122209.html#152698</guid><description><![CDATA[@_Yuan<br>您可以把您的程序改成现正后反试试<br>貌似wa了<img src ="http://www.cppblog.com/Yuan/aggbug/152698.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/Yuan/" target="_blank">QQ438846876 </a> 2011-08-07 09:21 <a href="http://www.cppblog.com/Yuan/archive/2011/08/07/122209.html#152698#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 2-SAT 小结</title><link>http://www.cppblog.com/Yuan/archive/2011/08/07/122209.html#152691</link><dc:creator>_Yuan</dc:creator><author>_Yuan</author><pubDate>Sat, 06 Aug 2011 18:41:00 GMT</pubDate><guid>http://www.cppblog.com/Yuan/archive/2011/08/07/122209.html#152691</guid><description><![CDATA[@QQ438846876<br>先正后反一样的吧<img src ="http://www.cppblog.com/Yuan/aggbug/152691.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/Yuan/" target="_blank">_Yuan</a> 2011-08-07 02:41 <a href="http://www.cppblog.com/Yuan/archive/2011/08/07/122209.html#152691#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 几道数位统计 用记忆化搜索写 很方便</title><link>http://www.cppblog.com/Yuan/archive/2011/08/01/139299.html#152207</link><dc:creator>peterae86</dc:creator><author>peterae86</author><pubDate>Mon, 01 Aug 2011 06:05:00 GMT</pubDate><guid>http://www.cppblog.com/Yuan/archive/2011/08/01/139299.html#152207</guid><description><![CDATA[请问,成都a题那个doing为什么要那样定义和转移,不是很理解<img src ="http://www.cppblog.com/Yuan/aggbug/152207.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/Yuan/" target="_blank">peterae86</a> 2011-08-01 14:05 <a href="http://www.cppblog.com/Yuan/archive/2011/08/01/139299.html#152207#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: hdu 2242 双连通缩点成树 tree dp</title><link>http://www.cppblog.com/Yuan/archive/2011/07/25/114003.html#151815</link><dc:creator>过客</dc:creator><author>过客</author><pubDate>Mon, 25 Jul 2011 11:32:00 GMT</pubDate><guid>http://www.cppblog.com/Yuan/archive/2011/07/25/114003.html#151815</guid><description><![CDATA[麻烦大牛看下我这种双联通缩点的方法对不？？<br>void dfs(int root,int father)<br>{<br>	int j,u;<br>	visit[root]=1;<br>	low[root]=cnt++;<br>	for(j=head[root];j!=-1;j=edge[j].next)<br>	{<br>		u=edge[j].to;<br>		if(u==father) continue;<br>		if(!visit[u]) dfs(u,root);<br>		if(low[u]&lt;low[root]) low[root]=low[u];<br>	}<br>}<img src ="http://www.cppblog.com/Yuan/aggbug/151815.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/Yuan/" target="_blank">过客</a> 2011-07-25 19:32 <a href="http://www.cppblog.com/Yuan/archive/2011/07/25/114003.html#151815#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: POJ 3017 单调队列 treap ★★★★</title><link>http://www.cppblog.com/Yuan/archive/2011/07/23/126692.html#151705</link><dc:creator>609942867</dc:creator><author>609942867</author><pubDate>Sat, 23 Jul 2011 11:20:00 GMT</pubDate><guid>http://www.cppblog.com/Yuan/archive/2011/07/23/126692.html#151705</guid><description><![CDATA[dp[x]+8 , dp[x+1]+6 , dp[x+2]+6 , dp[x+3]+6 , dp[x+4]+3第一个应该是<br>dp[x-1]+8吧<img src ="http://www.cppblog.com/Yuan/aggbug/151705.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/Yuan/" target="_blank">609942867</a> 2011-07-23 19:20 <a href="http://www.cppblog.com/Yuan/archive/2011/07/23/126692.html#151705#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: hdu 3400  枚举+三分  或者两重三分</title><link>http://www.cppblog.com/Yuan/archive/2011/07/22/114228.html#151660</link><dc:creator>klion26</dc:creator><author>klion26</author><pubDate>Fri, 22 Jul 2011 08:10:00 GMT</pubDate><guid>http://www.cppblog.com/Yuan/archive/2011/07/22/114228.html#151660</guid><description><![CDATA[你好,我想问下这题为啥可以三分,那个单峰函数是怎么推出来的？<img src ="http://www.cppblog.com/Yuan/aggbug/151660.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/Yuan/" target="_blank">klion26</a> 2011-07-22 16:10 <a href="http://www.cppblog.com/Yuan/archive/2011/07/22/114228.html#151660#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 几道数位统计 用记忆化搜索写 很方便</title><link>http://www.cppblog.com/Yuan/archive/2011/07/15/139299.html#151086</link><dc:creator>_Yuan</dc:creator><author>_Yuan</author><pubDate>Fri, 15 Jul 2011 12:15:00 GMT</pubDate><guid>http://www.cppblog.com/Yuan/archive/2011/07/15/139299.html#151086</guid><description><![CDATA[@JayGuy<br>多谢指出呀<br>pre&lt;0时应该不行的<img src ="http://www.cppblog.com/Yuan/aggbug/151086.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/Yuan/" target="_blank">_Yuan</a> 2011-07-15 20:15 <a href="http://www.cppblog.com/Yuan/archive/2011/07/15/139299.html#151086#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>