﻿<?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++博客-英雄哪里出来-最新评论</title><link>http://www.cppblog.com/menjitianya/CommentsRSS.aspx</link><description /><language>zh-cn</language><pubDate>Fri, 19 Mar 2021 12:33:35 GMT</pubDate><lastBuildDate>Fri, 19 Mar 2021 12:33:35 GMT</lastBuildDate><generator>cnblogs</generator><item><title>re: 高斯消元</title><link>http://www.cppblog.com/menjitianya/archive/2016/08/19/207226.html#214215</link><dc:creator>fanyuheng</dc:creator><author>fanyuheng</author><pubDate>Fri, 19 Aug 2016 12:26:00 GMT</pubDate><guid>http://www.cppblog.com/menjitianya/archive/2016/08/19/207226.html#214215</guid><description><![CDATA[非常感谢你的代码和说明，让我一次就看懂了，非常感谢！<img src ="http://www.cppblog.com/menjitianya/aggbug/214215.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/menjitianya/" target="_blank">fanyuheng</a> 2016-08-19 20:26 <a href="http://www.cppblog.com/menjitianya/archive/2016/08/19/207226.html#214215#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 夜深人静写算法（五） - 初等数论</title><link>http://www.cppblog.com/menjitianya/archive/2016/08/17/212395.html#214190</link><dc:creator>kirai</dc:creator><author>kirai</author><pubDate>Wed, 17 Aug 2016 08:10:00 GMT</pubDate><guid>http://www.cppblog.com/menjitianya/archive/2016/08/17/212395.html#214190</guid><description><![CDATA[C找循环节求递推式可以，也可以构造矩阵直接用矩阵快速幂啊~<img src ="http://www.cppblog.com/menjitianya/aggbug/214190.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/menjitianya/" target="_blank">kirai</a> 2016-08-17 16:10 <a href="http://www.cppblog.com/menjitianya/archive/2016/08/17/212395.html#214190#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 夜深人静写算法（三） - 树状数组</title><link>http://www.cppblog.com/menjitianya/archive/2016/08/15/212171.html#214178</link><dc:creator>zyzhang</dc:creator><author>zyzhang</author><pubDate>Mon, 15 Aug 2016 14:44:00 GMT</pubDate><guid>http://www.cppblog.com/menjitianya/archive/2016/08/15/212171.html#214178</guid><description><![CDATA[博主太厉害了<img src ="http://www.cppblog.com/menjitianya/aggbug/214178.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/menjitianya/" target="_blank">zyzhang</a> 2016-08-15 22:44 <a href="http://www.cppblog.com/menjitianya/archive/2016/08/15/212171.html#214178#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 夜深人静写算法（二） - 动态规划</title><link>http://www.cppblog.com/menjitianya/archive/2016/08/14/212084.html#214174</link><dc:creator>韩</dc:creator><author>韩</author><pubDate>Sun, 14 Aug 2016 09:05:00 GMT</pubDate><guid>http://www.cppblog.com/menjitianya/archive/2016/08/14/212084.html#214174</guid><description><![CDATA[楼主你好，例题8是不是不正确呢？把资金当价值，把概率当容量才对呀。<img src ="http://www.cppblog.com/menjitianya/aggbug/214174.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/menjitianya/" target="_blank">韩</a> 2016-08-14 17:05 <a href="http://www.cppblog.com/menjitianya/archive/2016/08/14/212084.html#214174#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 夜深人静写算法（二） - 动态规划[未登录]</title><link>http://www.cppblog.com/menjitianya/archive/2016/07/01/212084.html#213832</link><dc:creator>Gavin</dc:creator><author>Gavin</author><pubDate>Fri, 01 Jul 2016 12:23:00 GMT</pubDate><guid>http://www.cppblog.com/menjitianya/archive/2016/07/01/212084.html#213832</guid><description><![CDATA[可以答疑吗？ 第一个专题 1291 HDUClosing Ceremony of Sunny Cup可以给个思路吗？想不出好的方法<img src ="http://www.cppblog.com/menjitianya/aggbug/213832.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/menjitianya/" target="_blank">Gavin</a> 2016-07-01 20:23 <a href="http://www.cppblog.com/menjitianya/archive/2016/07/01/212084.html#213832#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: Zju 3170 7 Levels of Binary Search Tree (BST 应用)</title><link>http://www.cppblog.com/menjitianya/archive/2016/06/08/86810.html#213668</link><dc:creator>破军</dc:creator><author>破军</author><pubDate>Tue, 07 Jun 2016 17:29:00 GMT</pubDate><guid>http://www.cppblog.com/menjitianya/archive/2016/06/08/86810.html#213668</guid><description><![CDATA[谢谢你，前辈。<img src ="http://www.cppblog.com/menjitianya/aggbug/213668.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/menjitianya/" target="_blank">破军</a> 2016-06-08 01:29 <a href="http://www.cppblog.com/menjitianya/archive/2016/06/08/86810.html#213668#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 夜深人静写算法（二） - 动态规划[未登录]</title><link>http://www.cppblog.com/menjitianya/archive/2016/06/07/212084.html#213660</link><dc:creator>Tim</dc:creator><author>Tim</author><pubDate>Tue, 07 Jun 2016 01:29:00 GMT</pubDate><guid>http://www.cppblog.com/menjitianya/archive/2016/06/07/212084.html#213660</guid><description><![CDATA[既然，“图一-1-5，定义决定了它的形状就是多出来的块在下面的，如果再引入多出来的块在上面的情况就会重了”，那么为什么图一 -1-6中可以出出现未定义“多出来的块在上面” 的情况呢？是否定义是应该增加2种 多出来的块在上面的情况呢？<br>求大神答疑。<img src ="http://www.cppblog.com/menjitianya/aggbug/213660.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/menjitianya/" target="_blank">Tim</a> 2016-06-07 09:29 <a href="http://www.cppblog.com/menjitianya/archive/2016/06/07/212084.html#213660#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 夜深人静写算法（四） - 差分约束</title><link>http://www.cppblog.com/menjitianya/archive/2016/06/01/212292.html#213629</link><dc:creator>Rapiz</dc:creator><author>Rapiz</author><pubDate>Wed, 01 Jun 2016 13:00:00 GMT</pubDate><guid>http://www.cppblog.com/menjitianya/archive/2016/06/01/212292.html#213629</guid><description><![CDATA[“言之，用一个数组c[i]来记录i这个点入队的次数，所有的c[i]必定都小于等于n”<br>这里的&quot;小于等于&quot;应是写错了。<br><br>入队c[i]次的点的最短路包含c[i]+1个顶点。<br>比如邻s的点，边权足够小，那么它只会入队1次，包含2个顶点。<br><br>又因为最短路最长包含n个顶点，所以c[i]+1&lt;=n<br>推出c[i]&lt;n<br><br>这也就解释了我上一条评论的疑问。<br><img src ="http://www.cppblog.com/menjitianya/aggbug/213629.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/menjitianya/" target="_blank">Rapiz</a> 2016-06-01 21:00 <a href="http://www.cppblog.com/menjitianya/archive/2016/06/01/212292.html#213629#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 夜深人静写算法（四） - 差分约束</title><link>http://www.cppblog.com/menjitianya/archive/2016/06/01/212292.html#213628</link><dc:creator>Rapiz</dc:creator><author>Rapiz</author><pubDate>Wed, 01 Jun 2016 12:54:00 GMT</pubDate><guid>http://www.cppblog.com/menjitianya/archive/2016/06/01/212292.html#213628</guid><description><![CDATA[spfa中为何是vcnt++&gt;n判断负环？<br>假如n=10,一个点已经入队10次，那么这样写显然会允许第11次入队，那么入队次数就大于n了呀<img src ="http://www.cppblog.com/menjitianya/aggbug/213628.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/menjitianya/" target="_blank">Rapiz</a> 2016-06-01 20:54 <a href="http://www.cppblog.com/menjitianya/archive/2016/06/01/212292.html#213628#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 夜深人静写算法（三） - 树状数组</title><link>http://www.cppblog.com/menjitianya/archive/2016/05/30/212171.html#213609</link><dc:creator>任师锋</dc:creator><author>任师锋</author><pubDate>Mon, 30 May 2016 08:20:00 GMT</pubDate><guid>http://www.cppblog.com/menjitianya/archive/2016/05/30/212171.html#213609</guid><description><![CDATA[你好，IUPQ模型中，问题2，应该用sum(x)-sum(x-1)求得吧，在不保存A树组的情况下。问题1的解答能详细讲解吗？求解答<img src ="http://www.cppblog.com/menjitianya/aggbug/213609.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/menjitianya/" target="_blank">任师锋</a> 2016-05-30 16:20 <a href="http://www.cppblog.com/menjitianya/archive/2016/05/30/212171.html#213609#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 夜深人静写算法（四） - 差分约束</title><link>http://www.cppblog.com/menjitianya/archive/2016/04/12/212292.html#213243</link><dc:creator>_</dc:creator><author>_</author><pubDate>Tue, 12 Apr 2016 04:06:00 GMT</pubDate><guid>http://www.cppblog.com/menjitianya/archive/2016/04/12/212292.html#213243</guid><description><![CDATA[差分约束一直不懂，知道看到博主举的例子，醍醐灌顶，感谢分享<img src ="http://www.cppblog.com/menjitianya/aggbug/213243.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/menjitianya/" target="_blank">_</a> 2016-04-12 12:06 <a href="http://www.cppblog.com/menjitianya/archive/2016/04/12/212292.html#213243#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 夜深人静写算法（七）[2016 贺岁版] - 线段树</title><link>http://www.cppblog.com/menjitianya/archive/2016/03/07/212891.html#212940</link><dc:creator>mathfinder</dc:creator><author>mathfinder</author><pubDate>Sun, 06 Mar 2016 16:28:00 GMT</pubDate><guid>http://www.cppblog.com/menjitianya/archive/2016/03/07/212891.html#212940</guid><description><![CDATA[请问图四-4-11是不是有点问题，感觉插第三条线段，会把[2,4]节点的cover值堆到下面去，然后再递归更新子节点<img src ="http://www.cppblog.com/menjitianya/aggbug/212940.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/menjitianya/" target="_blank">mathfinder</a> 2016-03-07 00:28 <a href="http://www.cppblog.com/menjitianya/archive/2016/03/07/212891.html#212940#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 夜深人静写算法（二） - 动态规划</title><link>http://www.cppblog.com/menjitianya/archive/2016/01/18/212084.html#212685</link><dc:creator>dlutcs</dc:creator><author>dlutcs</author><pubDate>Mon, 18 Jan 2016 13:07:00 GMT</pubDate><guid>http://www.cppblog.com/menjitianya/archive/2016/01/18/212084.html#212685</guid><description><![CDATA[博主能不能把各个题的题号写上，一个一个得点链接不太容易做哎，有了题号就可以挂在vjudge上做一下<img src ="http://www.cppblog.com/menjitianya/aggbug/212685.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/menjitianya/" target="_blank">dlutcs</a> 2016-01-18 21:07 <a href="http://www.cppblog.com/menjitianya/archive/2016/01/18/212084.html#212685#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 夜深人静写算法（二） - 动态规划</title><link>http://www.cppblog.com/menjitianya/archive/2016/01/18/212084.html#212682</link><dc:creator>dlutcs</dc:creator><author>dlutcs</author><pubDate>Mon, 18 Jan 2016 07:16:00 GMT</pubDate><guid>http://www.cppblog.com/menjitianya/archive/2016/01/18/212084.html#212682</guid><description><![CDATA[例5的题目链接没有了<img src ="http://www.cppblog.com/menjitianya/aggbug/212682.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/menjitianya/" target="_blank">dlutcs</a> 2016-01-18 15:16 <a href="http://www.cppblog.com/menjitianya/archive/2016/01/18/212084.html#212682#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 夜深人静写算法（二） - 动态规划[未登录]</title><link>http://www.cppblog.com/menjitianya/archive/2016/01/16/212084.html#212671</link><dc:creator>英雄哪里出来</dc:creator><author>英雄哪里出来</author><pubDate>Sat, 16 Jan 2016 09:53:00 GMT</pubDate><guid>http://www.cppblog.com/menjitianya/archive/2016/01/16/212084.html#212671</guid><description><![CDATA[用f[i][j]表示(3 X i) + j个多余块的摆放方案数<br>结合图一-1-5，定义决定了它的形状就是多出来的块在下面的，如果再引入多出来的块在上面的情况就会重了<br>@7v<img src ="http://www.cppblog.com/menjitianya/aggbug/212671.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/menjitianya/" target="_blank">英雄哪里出来</a> 2016-01-16 17:53 <a href="http://www.cppblog.com/menjitianya/archive/2016/01/16/212084.html#212671#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 夜深人静写算法（六） - 最近公共祖先</title><link>http://www.cppblog.com/menjitianya/archive/2016/01/06/212447.html#212619</link><dc:creator>bns</dc:creator><author>bns</author><pubDate>Wed, 06 Jan 2016 07:41:00 GMT</pubDate><guid>http://www.cppblog.com/menjitianya/archive/2016/01/06/212447.html#212619</guid><description><![CDATA[丐帮、少林、逍遥、大理段氏四个集合<br><br>有意思<img src ="http://www.cppblog.com/menjitianya/aggbug/212619.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/menjitianya/" target="_blank">bns</a> 2016-01-06 15:41 <a href="http://www.cppblog.com/menjitianya/archive/2016/01/06/212447.html#212619#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 夜深人静写算法（二） - 动态规划</title><link>http://www.cppblog.com/menjitianya/archive/2016/01/05/212084.html#212604</link><dc:creator>7v</dc:creator><author>7v</author><pubDate>Tue, 05 Jan 2016 02:27:00 GMT</pubDate><guid>http://www.cppblog.com/menjitianya/archive/2016/01/05/212084.html#212604</guid><description><![CDATA[博主大牛 你好，请问<br>例题1，为什么边界条件是边界条件     f[0][0] = f[1][1] = f[0][2] = 1<br>f[1][1] 应该是2吧？您的 图一 -1-6，的f[i][1]，还有一种情况是 “多出来的块在上面” 的情况啊？<img src ="http://www.cppblog.com/menjitianya/aggbug/212604.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/menjitianya/" target="_blank">7v</a> 2016-01-05 10:27 <a href="http://www.cppblog.com/menjitianya/archive/2016/01/05/212084.html#212604#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 夜深人静写算法（六） - 最近公共祖先</title><link>http://www.cppblog.com/menjitianya/archive/2015/12/26/212447.html#212559</link><dc:creator>英雄哪里出来</dc:creator><author>英雄哪里出来</author><pubDate>Sat, 26 Dec 2015 06:11:00 GMT</pubDate><guid>http://www.cppblog.com/menjitianya/archive/2015/12/26/212447.html#212559</guid><description><![CDATA[@张晴川<br>哈哈是的，笔误了，多谢指正~~<img src ="http://www.cppblog.com/menjitianya/aggbug/212559.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/menjitianya/" target="_blank">英雄哪里出来</a> 2015-12-26 14:11 <a href="http://www.cppblog.com/menjitianya/archive/2015/12/26/212447.html#212559#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 夜深人静写算法（六） - 最近公共祖先</title><link>http://www.cppblog.com/menjitianya/archive/2015/12/22/212447.html#212539</link><dc:creator>张晴川</dc:creator><author>张晴川</author><pubDate>Tue, 22 Dec 2015 08:45:00 GMT</pubDate><guid>http://www.cppblog.com/menjitianya/archive/2015/12/22/212447.html#212539</guid><description><![CDATA[dist[u] + dist[v] - dist[a]<br><br>这里不应该减两个dist[a]吗？<img src ="http://www.cppblog.com/menjitianya/aggbug/212539.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/menjitianya/" target="_blank">张晴川</a> 2015-12-22 16:45 <a href="http://www.cppblog.com/menjitianya/archive/2015/12/22/212447.html#212539#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 夜深人静写算法（五） - 初等数论[未登录]</title><link>http://www.cppblog.com/menjitianya/archive/2015/12/04/212395.html#212412</link><dc:creator>Wang</dc:creator><author>Wang</author><pubDate>Fri, 04 Dec 2015 06:56:00 GMT</pubDate><guid>http://www.cppblog.com/menjitianya/archive/2015/12/04/212395.html#212412</guid><description><![CDATA[现在看到这些就头痛啦<img src ="http://www.cppblog.com/menjitianya/aggbug/212412.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/menjitianya/" target="_blank">Wang</a> 2015-12-04 14:56 <a href="http://www.cppblog.com/menjitianya/archive/2015/12/04/212395.html#212412#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 夜深人静写算法（四） - 差分约束</title><link>http://www.cppblog.com/menjitianya/archive/2015/11/30/212292.html#212365</link><dc:creator>Sleepless Loki</dc:creator><author>Sleepless Loki</author><pubDate>Mon, 30 Nov 2015 07:53:00 GMT</pubDate><guid>http://www.cppblog.com/menjitianya/archive/2015/11/30/212292.html#212365</guid><description><![CDATA[写得很不错。<img src ="http://www.cppblog.com/menjitianya/aggbug/212365.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/menjitianya/" target="_blank">Sleepless Loki</a> 2015-11-30 15:53 <a href="http://www.cppblog.com/menjitianya/archive/2015/11/30/212292.html#212365#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 夜深人静写算法（三） - 树状数组[未登录]</title><link>http://www.cppblog.com/menjitianya/archive/2015/11/17/212171.html#212276</link><dc:creator>英雄哪里出来</dc:creator><author>英雄哪里出来</author><pubDate>Tue, 17 Nov 2015 03:18:00 GMT</pubDate><guid>http://www.cppblog.com/menjitianya/archive/2015/11/17/212171.html#212276</guid><description><![CDATA[@春秋十二月<br>是的，夜深人静的时候写的~~呵呵~~<img src ="http://www.cppblog.com/menjitianya/aggbug/212276.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/menjitianya/" target="_blank">英雄哪里出来</a> 2015-11-17 11:18 <a href="http://www.cppblog.com/menjitianya/archive/2015/11/17/212171.html#212276#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 夜深人静写算法（三） - 树状数组</title><link>http://www.cppblog.com/menjitianya/archive/2015/11/13/212171.html#212260</link><dc:creator>春秋十二月</dc:creator><author>春秋十二月</author><pubDate>Fri, 13 Nov 2015 11:40:00 GMT</pubDate><guid>http://www.cppblog.com/menjitianya/archive/2015/11/13/212171.html#212260</guid><description><![CDATA[都是自己写的？<img src ="http://www.cppblog.com/menjitianya/aggbug/212260.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/menjitianya/" target="_blank">春秋十二月</a> 2015-11-13 19:40 <a href="http://www.cppblog.com/menjitianya/archive/2015/11/13/212171.html#212260#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 夜深人静写算法（二） - 动态规划</title><link>http://www.cppblog.com/menjitianya/archive/2015/11/04/212084.html#212183</link><dc:creator>张文</dc:creator><author>张文</author><pubDate>Wed, 04 Nov 2015 07:57:00 GMT</pubDate><guid>http://www.cppblog.com/menjitianya/archive/2015/11/04/212084.html#212183</guid><description><![CDATA[写的真好，谢谢。<img src ="http://www.cppblog.com/menjitianya/aggbug/212183.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/menjitianya/" target="_blank">张文</a> 2015-11-04 15:57 <a href="http://www.cppblog.com/menjitianya/archive/2015/11/04/212084.html#212183#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 夜深人静写算法（二） - 动态规划</title><link>http://www.cppblog.com/menjitianya/archive/2015/10/27/212084.html#212115</link><dc:creator>GameBoy</dc:creator><author>GameBoy</author><pubDate>Tue, 27 Oct 2015 07:42:00 GMT</pubDate><guid>http://www.cppblog.com/menjitianya/archive/2015/10/27/212084.html#212115</guid><description><![CDATA[英雄，你这是动态规划大全啊！<img src ="http://www.cppblog.com/menjitianya/aggbug/212115.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/menjitianya/" target="_blank">GameBoy</a> 2015-10-27 15:42 <a href="http://www.cppblog.com/menjitianya/archive/2015/10/27/212084.html#212115#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: AC自动机</title><link>http://www.cppblog.com/menjitianya/archive/2015/01/22/207604.html#209604</link><dc:creator>科室牌</dc:creator><author>科室牌</author><pubDate>Thu, 22 Jan 2015 00:58:00 GMT</pubDate><guid>http://www.cppblog.com/menjitianya/archive/2015/01/22/207604.html#209604</guid><description><![CDATA[建立trie图，每个字符串结尾标记记录模式串编号，进行目标串匹配的时候，利用哈希将所有是目标串子串的模式串标记为1，然后枚举所有标记过的模式串，对他们进行模式匹配，利用同样的方法将模式串的所有模式串子串标记为0，最后统计有多少个模式串的标记为1就是答案了，比如科室牌设计www.yfkeshipai.com也可以计算出每个字符串结尾标记记录模式串编号。<img src ="http://www.cppblog.com/menjitianya/aggbug/209604.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/menjitianya/" target="_blank">科室牌</a> 2015-01-22 08:58 <a href="http://www.cppblog.com/menjitianya/archive/2015/01/22/207604.html#209604#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: Southeastern Europe 2004 解题报告</title><link>http://www.cppblog.com/menjitianya/archive/2015/01/20/207926.html#209581</link><dc:creator>不锈钢信报箱</dc:creator><author>不锈钢信报箱</author><pubDate>Tue, 20 Jan 2015 01:49:00 GMT</pubDate><guid>http://www.cppblog.com/menjitianya/archive/2015/01/20/207926.html#209581</guid><description><![CDATA[这两个数组可以分别通过一次逆序和顺序的线性扫描求出来，用于搜索的时候判断可行性。例如，当T - P[L] &gt;= POSTM[R] 表示在右边未访问的宝物中有至少一个宝物不能在截止时间前被访问到，T + P[R] &gt;= PREM [R]表示在左边未访问的宝物中有至少一个宝物不能在截止时间前被访问到，直接剪枝www.yfxinbaoxiang.com/<img src ="http://www.cppblog.com/menjitianya/aggbug/209581.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/menjitianya/" target="_blank">不锈钢信报箱</a> 2015-01-20 09:49 <a href="http://www.cppblog.com/menjitianya/archive/2015/01/20/207926.html#209581#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: Southeastern Europe 2004 解题报告</title><link>http://www.cppblog.com/menjitianya/archive/2015/01/20/207926.html#209580</link><dc:creator>不锈钢信报箱</dc:creator><author>不锈钢信报箱</author><pubDate>Tue, 20 Jan 2015 01:48:00 GMT</pubDate><guid>http://www.cppblog.com/menjitianya/archive/2015/01/20/207926.html#209580</guid><description><![CDATA[首先可以想到的是，起始位置一定是N个宝物所在位置中的其中一个，所以首先可以枚举每个宝物的起始点，比如当前位置为pos，那么在第0秒内，访问过的区间为[pos, pos]，可以选择往左走，也可以选择往右走，那么是不是只要选择某个方向走完，然后再反方向走到底如果能够满足所有点都在截止时间内完成一定是对的呢？答案就是<a target="_new" href="http://www.yfxinbaoxiang.com/">http://www.yfxinbaoxiang.com/</a><img src ="http://www.cppblog.com/menjitianya/aggbug/209580.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/menjitianya/" target="_blank">不锈钢信报箱</a> 2015-01-20 09:48 <a href="http://www.cppblog.com/menjitianya/archive/2015/01/20/207926.html#209580#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 高斯消元</title><link>http://www.cppblog.com/menjitianya/archive/2014/11/18/207226.html#208921</link><dc:creator>cdy</dc:creator><author>cdy</author><pubDate>Tue, 18 Nov 2014 10:20:00 GMT</pubDate><guid>http://www.cppblog.com/menjitianya/archive/2014/11/18/207226.html#208921</guid><description><![CDATA[马克<img src ="http://www.cppblog.com/menjitianya/aggbug/208921.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/menjitianya/" target="_blank">cdy</a> 2014-11-18 18:20 <a href="http://www.cppblog.com/menjitianya/archive/2014/11/18/207226.html#208921#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: SGU 120 - 129 解题报告</title><link>http://www.cppblog.com/menjitianya/archive/2014/09/29/207316.html#208452</link><dc:creator>天天好逼网</dc:creator><author>天天好逼网</author><pubDate>Mon, 29 Sep 2014 13:09:00 GMT</pubDate><guid>http://www.cppblog.com/menjitianya/archive/2014/09/29/207316.html#208452</guid><description><![CDATA[于给定的点是乱序的，所以最简单的方法是求这些点集的一个凸包，构造出一个按点排序的多边形，相邻两点连线为原多边形的一条边。<br><br>那么枚举每条边和给定线段的相交情况：天天好逼网www.ssnz88.net<img src ="http://www.cppblog.com/menjitianya/aggbug/208452.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/menjitianya/" target="_blank">天天好逼网</a> 2014-09-29 21:09 <a href="http://www.cppblog.com/menjitianya/archive/2014/09/29/207316.html#208452#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: Southeastern Europe 2004 解题报告</title><link>http://www.cppblog.com/menjitianya/archive/2014/08/10/207926.html#207956</link><dc:creator>信报箱</dc:creator><author>信报箱</author><pubDate>Sun, 10 Aug 2014 09:30:00 GMT</pubDate><guid>http://www.cppblog.com/menjitianya/archive/2014/08/10/207926.html#207956</guid><description><![CDATA[首先二分求出在第几条斜线上，即(K-1)K/2 &lt; N的最大的K，然后求根据K的奇偶性求出蛇形在第K条斜线的行走方向，第N - (K-1)K/2 个数就是答案www.yongfengxbx.com<img src ="http://www.cppblog.com/menjitianya/aggbug/207956.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/menjitianya/" target="_blank">信报箱</a> 2014-08-10 17:30 <a href="http://www.cppblog.com/menjitianya/archive/2014/08/10/207926.html#207956#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: South Central USA 2002 解题报告</title><link>http://www.cppblog.com/menjitianya/archive/2014/08/04/207869.html#207909</link><dc:creator>zhangzhuojun123</dc:creator><author>zhangzhuojun123</author><pubDate>Mon, 04 Aug 2014 14:35:00 GMT</pubDate><guid>http://www.cppblog.com/menjitianya/archive/2014/08/04/207869.html#207909</guid><description><![CDATA[( ⊙o⊙ )哇，原来1301少考虑了方向，怪不得一直wa<img src ="http://www.cppblog.com/menjitianya/aggbug/207909.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/menjitianya/" target="_blank">zhangzhuojun123</a> 2014-08-04 22:35 <a href="http://www.cppblog.com/menjitianya/archive/2014/08/04/207869.html#207909#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: AC自动机</title><link>http://www.cppblog.com/menjitianya/archive/2014/07/20/207604.html#207726</link><dc:creator>orz_zro</dc:creator><author>orz_zro</author><pubDate>Sun, 20 Jul 2014 11:48:00 GMT</pubDate><guid>http://www.cppblog.com/menjitianya/archive/2014/07/20/207604.html#207726</guid><description><![CDATA[看了好几篇关于失败指针的文章，终于明白是什么意思啦，谢谢( ⊙o⊙ )<img src ="http://www.cppblog.com/menjitianya/aggbug/207726.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/menjitianya/" target="_blank">orz_zro</a> 2014-07-20 19:48 <a href="http://www.cppblog.com/menjitianya/archive/2014/07/20/207604.html#207726#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: KMP</title><link>http://www.cppblog.com/menjitianya/archive/2014/07/18/207354.html#207696</link><dc:creator>xuezhanghao</dc:creator><author>xuezhanghao</author><pubDate>Fri, 18 Jul 2014 13:33:00 GMT</pubDate><guid>http://www.cppblog.com/menjitianya/archive/2014/07/18/207354.html#207696</guid><description><![CDATA[学习了<img src ="http://www.cppblog.com/menjitianya/aggbug/207696.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/menjitianya/" target="_blank">xuezhanghao</a> 2014-07-18 21:33 <a href="http://www.cppblog.com/menjitianya/archive/2014/07/18/207354.html#207696#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: AC自动机</title><link>http://www.cppblog.com/menjitianya/archive/2014/07/17/207604.html#207684</link><dc:creator>ac_star</dc:creator><author>ac_star</author><pubDate>Thu, 17 Jul 2014 11:26:00 GMT</pubDate><guid>http://www.cppblog.com/menjitianya/archive/2014/07/17/207604.html#207684</guid><description><![CDATA[赞~\(≧▽≦)/~<img src ="http://www.cppblog.com/menjitianya/aggbug/207684.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/menjitianya/" target="_blank">ac_star</a> 2014-07-17 19:26 <a href="http://www.cppblog.com/menjitianya/archive/2014/07/17/207604.html#207684#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: AC自动机</title><link>http://www.cppblog.com/menjitianya/archive/2014/07/11/207604.html#207622</link><dc:creator>zhangchong0202</dc:creator><author>zhangchong0202</author><pubDate>Fri, 11 Jul 2014 14:41:00 GMT</pubDate><guid>http://www.cppblog.com/menjitianya/archive/2014/07/11/207604.html#207622</guid><description><![CDATA[一直没有勇气学这个算法...<img src ="http://www.cppblog.com/menjitianya/aggbug/207622.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/menjitianya/" target="_blank">zhangchong0202</a> 2014-07-11 22:41 <a href="http://www.cppblog.com/menjitianya/archive/2014/07/11/207604.html#207622#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: SGU 140 - 149 解题报告</title><link>http://www.cppblog.com/menjitianya/archive/2014/07/11/207542.html#207608</link><dc:creator>蘑菇姐</dc:creator><author>蘑菇姐</author><pubDate>Thu, 10 Jul 2014 16:17:00 GMT</pubDate><guid>http://www.cppblog.com/menjitianya/archive/2014/07/11/207542.html#207608</guid><description><![CDATA[因为每次选取待定最长路的时候需要用前驱编号来判断是选最长路还是选次长路。<img src ="http://www.cppblog.com/menjitianya/aggbug/207608.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/menjitianya/" target="_blank">蘑菇姐</a> 2014-07-11 00:17 <a href="http://www.cppblog.com/menjitianya/archive/2014/07/11/207542.html#207608#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: AC自动机</title><link>http://www.cppblog.com/menjitianya/archive/2014/07/11/207604.html#207607</link><dc:creator>蘑菇姐</dc:creator><author>蘑菇姐</author><pubDate>Thu, 10 Jul 2014 16:16:00 GMT</pubDate><guid>http://www.cppblog.com/menjitianya/archive/2014/07/11/207604.html#207607</guid><description><![CDATA[求这个字符串的最短长度<img src ="http://www.cppblog.com/menjitianya/aggbug/207607.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/menjitianya/" target="_blank">蘑菇姐</a> 2014-07-11 00:16 <a href="http://www.cppblog.com/menjitianya/archive/2014/07/11/207604.html#207607#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: AC自动机</title><link>http://www.cppblog.com/menjitianya/archive/2014/07/10/207604.html#207606</link><dc:creator>zjut287201201</dc:creator><author>zjut287201201</author><pubDate>Thu, 10 Jul 2014 08:59:00 GMT</pubDate><guid>http://www.cppblog.com/menjitianya/archive/2014/07/10/207604.html#207606</guid><description><![CDATA[这么多题哦，有的做做啦 ^_^ <img src ="http://www.cppblog.com/menjitianya/aggbug/207606.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/menjitianya/" target="_blank">zjut287201201</a> 2014-07-10 16:59 <a href="http://www.cppblog.com/menjitianya/archive/2014/07/10/207604.html#207606#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: SGU 140 - 149 解题报告</title><link>http://www.cppblog.com/menjitianya/archive/2014/07/10/207542.html#207597</link><dc:creator>smallBird</dc:creator><author>smallBird</author><pubDate>Thu, 10 Jul 2014 00:12:00 GMT</pubDate><guid>http://www.cppblog.com/menjitianya/archive/2014/07/10/207542.html#207597</guid><description><![CDATA[话说145一直PE是怎么回事？？？<img src ="http://www.cppblog.com/menjitianya/aggbug/207597.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/menjitianya/" target="_blank">smallBird</a> 2014-07-10 08:12 <a href="http://www.cppblog.com/menjitianya/archive/2014/07/10/207542.html#207597#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>