﻿<?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++博客-ACM乐园-最新评论</title><link>http://www.cppblog.com/zhangwangcz/CommentsRSS.aspx</link><description>Love Me,Love My Code!</description><language>zh-cn</language><pubDate>Tue, 21 May 2013 09:35:49 GMT</pubDate><lastBuildDate>Tue, 21 May 2013 09:35:49 GMT</lastBuildDate><generator>cnblogs</generator><item><title>re: 会场安排问题（贪心算法）</title><link>http://www.cppblog.com/zhangwangcz/archive/2013/05/06/193502.html#200020</link><dc:creator>gg</dc:creator><author>gg</author><pubDate>Mon, 06 May 2013 08:26:00 GMT</pubDate><guid>http://www.cppblog.com/zhangwangcz/archive/2013/05/06/193502.html#200020</guid><description><![CDATA[#include&lt;stdio.h&gt;<br>#define N 101<br>void main()<br>{<br>	int a[N]={0}, s,e,k,max;<br>	scanf(&quot;%d&quot;,&amp;k);<br>	for(int i=1;i&lt;=k;i++)<br>	{<br>		scanf(&quot;%d%d&quot;,&amp;s,&amp;e);<br>		for(;s&lt;=e;s++)<br>			a[s]++;<br>	}<br>	max=a[1];<br>	for(int i=2;i&lt;=N;i++)<br>		if(max&lt;a[i])max=a[i];<br>	printf(&quot;%d&quot;,max);<br>}<img src ="http://www.cppblog.com/zhangwangcz/aggbug/200020.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/zhangwangcz/" target="_blank">gg</a> 2013-05-06 16:26 <a href="http://www.cppblog.com/zhangwangcz/archive/2013/05/06/193502.html#200020#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 淘宝面试：如何判断两个单向链表是否有相交，并找出交点</title><link>http://www.cppblog.com/zhangwangcz/archive/2012/12/06/144343.html#196055</link><dc:creator>大大木马</dc:creator><author>大大木马</author><pubDate>Thu, 06 Dec 2012 12:34:00 GMT</pubDate><guid>http://www.cppblog.com/zhangwangcz/archive/2012/12/06/144343.html#196055</guid><description><![CDATA[只考虑了单向链表@111<br><img src ="http://www.cppblog.com/zhangwangcz/aggbug/196055.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/zhangwangcz/" target="_blank">大大木马</a> 2012-12-06 20:34 <a href="http://www.cppblog.com/zhangwangcz/archive/2012/12/06/144343.html#196055#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 淘宝面试：如何判断两个单向链表是否有相交，并找出交点[未登录]</title><link>http://www.cppblog.com/zhangwangcz/archive/2012/12/06/144343.html#196054</link><dc:creator>111</dc:creator><author>111</author><pubDate>Thu, 06 Dec 2012 12:33:00 GMT</pubDate><guid>http://www.cppblog.com/zhangwangcz/archive/2012/12/06/144343.html#196054</guid><description><![CDATA[没有考虑有环的情况吧<img src ="http://www.cppblog.com/zhangwangcz/aggbug/196054.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/zhangwangcz/" target="_blank">111</a> 2012-12-06 20:33 <a href="http://www.cppblog.com/zhangwangcz/archive/2012/12/06/144343.html#196054#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: HDU 1201</title><link>http://www.cppblog.com/zhangwangcz/archive/2012/11/15/143222.html#195228</link><dc:creator>木马</dc:creator><author>木马</author><pubDate>Thu, 15 Nov 2012 04:38:00 GMT</pubDate><guid>http://www.cppblog.com/zhangwangcz/archive/2012/11/15/143222.html#195228</guid><description><![CDATA[AC了呀，哪里有问题？<br>@liaoke<br><img src ="http://www.cppblog.com/zhangwangcz/aggbug/195228.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/zhangwangcz/" target="_blank">木马</a> 2012-11-15 12:38 <a href="http://www.cppblog.com/zhangwangcz/archive/2012/11/15/143222.html#195228#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: HDU 1201</title><link>http://www.cppblog.com/zhangwangcz/archive/2012/11/14/143222.html#195208</link><dc:creator>liaoke</dc:creator><author>liaoke</author><pubDate>Wed, 14 Nov 2012 15:27:00 GMT</pubDate><guid>http://www.cppblog.com/zhangwangcz/archive/2012/11/14/143222.html#195208</guid><description><![CDATA[这是错误的答案<img src ="http://www.cppblog.com/zhangwangcz/aggbug/195208.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/zhangwangcz/" target="_blank">liaoke</a> 2012-11-14 23:27 <a href="http://www.cppblog.com/zhangwangcz/archive/2012/11/14/143222.html#195208#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: HDU 1272并查集判断是否有环</title><link>http://www.cppblog.com/zhangwangcz/archive/2012/09/21/145021.html#191544</link><dc:creator>木马</dc:creator><author>木马</author><pubDate>Fri, 21 Sep 2012 15:17:00 GMT</pubDate><guid>http://www.cppblog.com/zhangwangcz/archive/2012/09/21/145021.html#191544</guid><description><![CDATA[如果是同一个说明他们是连通的@ontseason<br><img src ="http://www.cppblog.com/zhangwangcz/aggbug/191544.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/zhangwangcz/" target="_blank">木马</a> 2012-09-21 23:17 <a href="http://www.cppblog.com/zhangwangcz/archive/2012/09/21/145021.html#191544#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: HDU 1272并查集判断是否有环</title><link>http://www.cppblog.com/zhangwangcz/archive/2012/09/21/145021.html#191462</link><dc:creator>ontseason</dc:creator><author>ontseason</author><pubDate>Fri, 21 Sep 2012 04:18:00 GMT</pubDate><guid>http://www.cppblog.com/zhangwangcz/archive/2012/09/21/145021.html#191462</guid><description><![CDATA[判断你要连接的两点的祖先节点是否是同一个就行？<img src ="http://www.cppblog.com/zhangwangcz/aggbug/191462.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/zhangwangcz/" target="_blank">ontseason</a> 2012-09-21 12:18 <a href="http://www.cppblog.com/zhangwangcz/archive/2012/09/21/145021.html#191462#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: HDU 1698</title><link>http://www.cppblog.com/zhangwangcz/archive/2012/08/04/145697.html#186258</link><dc:creator>李硕</dc:creator><author>李硕</author><pubDate>Sat, 04 Aug 2012 07:46:00 GMT</pubDate><guid>http://www.cppblog.com/zhangwangcz/archive/2012/08/04/145697.html#186258</guid><description><![CDATA[您的代码写的真漂亮嘿嘿.<img src ="http://www.cppblog.com/zhangwangcz/aggbug/186258.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/zhangwangcz/" target="_blank">李硕</a> 2012-08-04 15:46 <a href="http://www.cppblog.com/zhangwangcz/archive/2012/08/04/145697.html#186258#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: HDU1151有向图最小路径覆盖</title><link>http://www.cppblog.com/zhangwangcz/archive/2012/03/30/155686.html#169506</link><dc:creator>acm百科网</dc:creator><author>acm百科网</author><pubDate>Fri, 30 Mar 2012 05:05:00 GMT</pubDate><guid>http://www.cppblog.com/zhangwangcz/archive/2012/03/30/155686.html#169506</guid><description><![CDATA[您好，acm百科网（ <a target="_new" href="<a target="_new" href="http://www.acmwiki.com">http://www.acmwiki.com</a>"><a target="_new" href="http://www.acmwiki.com">http://www.acmwiki.com</a></a> ）已收录了您的本篇文章，如有异议，请联系我们。<br>-------------------------------------------------------<br><a target="_new" href="<a target="_new" href="http://www.acmwiki.com">http://www.acmwiki.com</a>"><a target="_new" href="http://www.acmwiki.com">http://www.acmwiki.com</a></a> <br>acm百科网提供解题报告 学习经验<br>-------------------------------------------------------<img src ="http://www.cppblog.com/zhangwangcz/aggbug/169506.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/zhangwangcz/" target="_blank">acm百科网</a> 2012-03-30 13:05 <a href="http://www.cppblog.com/zhangwangcz/archive/2012/03/30/155686.html#169506#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: HDU2147博弈</title><link>http://www.cppblog.com/zhangwangcz/archive/2011/09/28/156060.html#157056</link><dc:creator>大大木马</dc:creator><author>大大木马</author><pubDate>Wed, 28 Sep 2011 02:33:00 GMT</pubDate><guid>http://www.cppblog.com/zhangwangcz/archive/2011/09/28/156060.html#157056</guid><description><![CDATA[写错题号了，是2147，不好意思~~@oa414<br><img src ="http://www.cppblog.com/zhangwangcz/aggbug/157056.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/zhangwangcz/" target="_blank">大大木马</a> 2011-09-28 10:33 <a href="http://www.cppblog.com/zhangwangcz/archive/2011/09/28/156060.html#157056#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>