﻿<?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++博客-w2001-最新评论</title><link>http://www.cppblog.com/w2001/CommentsRSS.aspx</link><description>camouflage.</description><language>zh-cn</language><pubDate>Fri, 13 Apr 2012 16:20:32 GMT</pubDate><lastBuildDate>Fri, 13 Apr 2012 16:20:32 GMT</lastBuildDate><generator>cnblogs</generator><item><title>re: 判断点是否处于多边形内的三种方法</title><link>http://www.cppblog.com/w2001/archive/2011/12/21/31694.html#162540</link><dc:creator>龙凼毛毛虫</dc:creator><author>龙凼毛毛虫</author><pubDate>Wed, 21 Dec 2011 08:17:00 GMT</pubDate><guid>http://www.cppblog.com/w2001/archive/2011/12/21/31694.html#162540</guid><description><![CDATA[第3种好像不太对吧。我只考虑三角形的情况，就算点钟三角形外，这个点和三角形两两相连所成都夹角和依然是360度，有一个角是大于180度的。三角形的情况判别条件是否可以改为：选择小于180度的角度情况下，算3个角度的和小于360度就可以判断点钟三角形外了吧。<img src ="http://www.cppblog.com/w2001/aggbug/162540.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/w2001/" target="_blank">龙凼毛毛虫</a> 2011-12-21 16:17 <a href="http://www.cppblog.com/w2001/archive/2011/12/21/31694.html#162540#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 最大子段和问题的动态规划求解</title><link>http://www.cppblog.com/w2001/archive/2011/09/16/20397.html#155945</link><dc:creator>田峰</dc:creator><author>田峰</author><pubDate>Fri, 16 Sep 2011 07:26:00 GMT</pubDate><guid>http://www.cppblog.com/w2001/archive/2011/09/16/20397.html#155945</guid><description><![CDATA[你说的对@benben<br><img src ="http://www.cppblog.com/w2001/aggbug/155945.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/w2001/" target="_blank">田峰</a> 2011-09-16 15:26 <a href="http://www.cppblog.com/w2001/archive/2011/09/16/20397.html#155945#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 最大子段和问题的动态规划求解</title><link>http://www.cppblog.com/w2001/archive/2011/07/20/20397.html#151505</link><dc:creator>benben</dc:creator><author>benben</author><pubDate>Wed, 20 Jul 2011 14:19:00 GMT</pubDate><guid>http://www.cppblog.com/w2001/archive/2011/07/20/20397.html#151505</guid><description><![CDATA[pdf里好像有点错<br>b[j]的定义应该为max(下标为1&lt;=m&lt;=j)而不是下标1&lt;=j&lt;=n<img src ="http://www.cppblog.com/w2001/aggbug/151505.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/w2001/" target="_blank">benben</a> 2011-07-20 22:19 <a href="http://www.cppblog.com/w2001/archive/2011/07/20/20397.html#151505#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 【zz】关于app2sd、a2sd、data2sd、a2sd+的区别的解释</title><link>http://www.cppblog.com/w2001/archive/2011/06/28/139243.html#149643</link><dc:creator>opk</dc:creator><author>opk</author><pubDate>Tue, 28 Jun 2011 03:49:00 GMT</pubDate><guid>http://www.cppblog.com/w2001/archive/2011/06/28/139243.html#149643</guid><description><![CDATA[app2ext<br>link2ext <br>现在有了data2ext<img src ="http://www.cppblog.com/w2001/aggbug/149643.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/w2001/" target="_blank">opk</a> 2011-06-28 11:49 <a href="http://www.cppblog.com/w2001/archive/2011/06/28/139243.html#149643#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 判断点是否处于多边形内的三种方法</title><link>http://www.cppblog.com/w2001/archive/2011/06/17/31694.html#148862</link><dc:creator>aa</dc:creator><author>aa</author><pubDate>Fri, 17 Jun 2011 06:51:00 GMT</pubDate><guid>http://www.cppblog.com/w2001/archive/2011/06/17/31694.html#148862</guid><description><![CDATA[第四种不全面<br>如果射线穿越顶点，则是不确定的，需要再进行计算。<img src ="http://www.cppblog.com/w2001/aggbug/148862.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/w2001/" target="_blank">aa</a> 2011-06-17 14:51 <a href="http://www.cppblog.com/w2001/archive/2011/06/17/31694.html#148862#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 【zz】关于app2sd、a2sd、data2sd、a2sd+的区别的解释</title><link>http://www.cppblog.com/w2001/archive/2011/05/12/139243.html#146241</link><dc:creator>无人</dc:creator><author>无人</author><pubDate>Thu, 12 May 2011 02:28:00 GMT</pubDate><guid>http://www.cppblog.com/w2001/archive/2011/05/12/139243.html#146241</guid><description><![CDATA[不错，学习了，<img src ="http://www.cppblog.com/w2001/aggbug/146241.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/w2001/" target="_blank">无人</a> 2011-05-12 10:28 <a href="http://www.cppblog.com/w2001/archive/2011/05/12/139243.html#146241#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 小学生数学奥赛题</title><link>http://www.cppblog.com/w2001/archive/2011/04/23/22240.html#144838</link><dc:creator>李丽</dc:creator><author>李丽</author><pubDate>Sat, 23 Apr 2011 03:08:00 GMT</pubDate><guid>http://www.cppblog.com/w2001/archive/2011/04/23/22240.html#144838</guid><description><![CDATA[若3x+2y+4=10.6,则6x+4y-4=(        )<img src ="http://www.cppblog.com/w2001/aggbug/144838.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/w2001/" target="_blank">李丽</a> 2011-04-23 11:08 <a href="http://www.cppblog.com/w2001/archive/2011/04/23/22240.html#144838#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 最大子段和问题的动态规划求解</title><link>http://www.cppblog.com/w2001/archive/2011/04/03/20397.html#143341</link><dc:creator>Cnfn</dc:creator><author>Cnfn</author><pubDate>Sun, 03 Apr 2011 06:21:00 GMT</pubDate><guid>http://www.cppblog.com/w2001/archive/2011/04/03/20397.html#143341</guid><description><![CDATA[恩, 不错不错, 很厉害!<img src ="http://www.cppblog.com/w2001/aggbug/143341.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/w2001/" target="_blank">Cnfn</a> 2011-04-03 14:21 <a href="http://www.cppblog.com/w2001/archive/2011/04/03/20397.html#143341#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>卡介苗的解释</title><link>http://www.cppblog.com/w2001/archive/2011/02/25/139243.html#140667</link><dc:creator>98978</dc:creator><author>98978</author><pubDate>Fri, 25 Feb 2011 11:41:00 GMT</pubDate><guid>http://www.cppblog.com/w2001/archive/2011/02/25/139243.html#140667</guid><description><![CDATA[同意特也有合约大叶杨月很久很久的<img src ="http://www.cppblog.com/w2001/aggbug/140667.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/w2001/" target="_blank">98978</a> 2011-02-25 19:41 <a href="http://www.cppblog.com/w2001/archive/2011/02/25/139243.html#140667#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 最大子矩阵和问题[未登录]</title><link>http://www.cppblog.com/w2001/archive/2011/02/04/20443.html#139732</link><dc:creator>_飞寒</dc:creator><author>_飞寒</author><pubDate>Fri, 04 Feb 2011 14:56:00 GMT</pubDate><guid>http://www.cppblog.com/w2001/archive/2011/02/04/20443.html#139732</guid><description><![CDATA[&quot;有没有可能对两个维度进行联合的动态规划求解呢? &quot; <br><br>  我也想知道是否存在这样的方法<img src ="http://www.cppblog.com/w2001/aggbug/139732.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/w2001/" target="_blank">_飞寒</a> 2011-02-04 22:56 <a href="http://www.cppblog.com/w2001/archive/2011/02/04/20443.html#139732#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>