﻿<?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++博客-【♂Not The Triumph♂O(∩_∩)O哈哈~But The Struggle♂】-最新评论</title><link>http://www.cppblog.com/xiongnanbin/CommentsRSS.aspx</link><description>竞赛决不是捷径，它只是另一种艰辛的生活方式。得到与失去，只有时间会去评判；成功与失败，只有历史能去仲裁。我不会永远成功，正如我不会永远失败一样</description><language>zh-cn</language><pubDate>Thu, 08 Oct 2009 02:26:18 GMT</pubDate><lastBuildDate>Thu, 08 Oct 2009 02:26:18 GMT</lastBuildDate><generator>cnblogs</generator><item><title>re: 【NOI 98 免费馅饼】</title><link>http://www.cppblog.com/xiongnanbin/archive/2009/10/09/94051.html#98149</link><dc:creator>nomanme</dc:creator><author>nomanme</author><pubDate>Fri, 09 Oct 2009 05:45:00 GMT</pubDate><guid>http://www.cppblog.com/xiongnanbin/archive/2009/10/09/94051.html#98149</guid><description><![CDATA[这里为什么要判断t＝＝0？？？？<br>if ((m-1)%v==0 || t==0)<br>        {<br>            a[t+(m-1)/v][w]+=s;<br>            if (t+(m-1)/v&gt;sumt) sumt=t+(m-1)/v;<br>        }<br><img src ="http://www.cppblog.com/xiongnanbin/aggbug/98149.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/xiongnanbin/" target="_blank">nomanme</a> 2009-10-09 13:45 <a href="http://www.cppblog.com/xiongnanbin/archive/2009/10/09/94051.html#98149#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 【Greedy Gift Givers贪婪的送礼者】</title><link>http://www.cppblog.com/xiongnanbin/archive/2009/08/17/90019.html#93656</link><dc:creator>karis</dc:creator><author>karis</author><pubDate>Mon, 17 Aug 2009 14:36:00 GMT</pubDate><guid>http://www.cppblog.com/xiongnanbin/archive/2009/08/17/90019.html#93656</guid><description><![CDATA[就好比说这句话 memset(qian,0,sizeof(qian));，什么意思能解释一下吗？<img src ="http://www.cppblog.com/xiongnanbin/aggbug/93656.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/xiongnanbin/" target="_blank">karis</a> 2009-08-17 22:36 <a href="http://www.cppblog.com/xiongnanbin/archive/2009/08/17/90019.html#93656#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 【Greedy Gift Givers贪婪的送礼者】</title><link>http://www.cppblog.com/xiongnanbin/archive/2009/08/17/90019.html#93655</link><dc:creator>karis</dc:creator><author>karis</author><pubDate>Mon, 17 Aug 2009 14:34:00 GMT</pubDate><guid>http://www.cppblog.com/xiongnanbin/archive/2009/08/17/90019.html#93655</guid><description><![CDATA[我是一个新手，请这位大神能不能详细解释一下这个程序，我正在做USACO1.1的题，能不能请您稍微解释下您的程序，我有一些不懂得地方，请帮下忙吧我的邮箱：sss55546825@yahoo.com.cn<img src ="http://www.cppblog.com/xiongnanbin/aggbug/93655.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/xiongnanbin/" target="_blank">karis</a> 2009-08-17 22:34 <a href="http://www.cppblog.com/xiongnanbin/archive/2009/08/17/90019.html#93655#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 【最大连续子序列】[未登录]</title><link>http://www.cppblog.com/xiongnanbin/archive/2009/07/26/78186.html#91229</link><dc:creator>YY</dc:creator><author>YY</author><pubDate>Sun, 26 Jul 2009 03:00:00 GMT</pubDate><guid>http://www.cppblog.com/xiongnanbin/archive/2009/07/26/78186.html#91229</guid><description><![CDATA[大哥 这题目有O(N)的算法啊 DP <img src ="http://www.cppblog.com/xiongnanbin/aggbug/91229.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/xiongnanbin/" target="_blank">YY</a> 2009-07-26 11:00 <a href="http://www.cppblog.com/xiongnanbin/archive/2009/07/26/78186.html#91229#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 【拔河比赛】</title><link>http://www.cppblog.com/xiongnanbin/archive/2009/05/09/78228.html#82414</link><dc:creator>tian</dc:creator><author>tian</author><pubDate>Sat, 09 May 2009 11:48:00 GMT</pubDate><guid>http://www.cppblog.com/xiongnanbin/archive/2009/05/09/78228.html#82414</guid><description><![CDATA[bo:array[0..100,0..45000]of boolean；<br>好像应为<br>bo:array[0..100,0..45450]of boolean<br>吧？<img src ="http://www.cppblog.com/xiongnanbin/aggbug/82414.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/xiongnanbin/" target="_blank">tian</a> 2009-05-09 19:48 <a href="http://www.cppblog.com/xiongnanbin/archive/2009/05/09/78228.html#82414#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 【拔河比赛】</title><link>http://www.cppblog.com/xiongnanbin/archive/2009/05/07/78228.html#82182</link><dc:creator>zjr</dc:creator><author>zjr</author><pubDate>Thu, 07 May 2009 12:57:00 GMT</pubDate><guid>http://www.cppblog.com/xiongnanbin/archive/2009/05/07/78228.html#82182</guid><description><![CDATA[bo[j+1,k+w[i]]:=bo[j+1,k+w[i]] or bo[j,k];<br>中的or是什么意思？<img src ="http://www.cppblog.com/xiongnanbin/aggbug/82182.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/xiongnanbin/" target="_blank">zjr</a> 2009-05-07 20:57 <a href="http://www.cppblog.com/xiongnanbin/archive/2009/05/07/78228.html#82182#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>