<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Nobel7889的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Nobel7889</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Nobel7889]]></copyright><item><title><![CDATA[是男人就过 8 题--Pony.AI 题A String Game(博弈 SG 后缀自动机)]]></title><link>https://blog.youkuaiyun.com/Nobel7889/article/details/102087637</link><guid>https://blog.youkuaiyun.com/Nobel7889/article/details/102087637</guid><author>Nobel7889</author><pubDate>Sat, 11 Aug 2018 12:07:00 +0800</pubDate><description><![CDATA[将每个单轮的SG函数抑或可得最终结果。
为了计算SG函数，先对主串用后缀自动机处理，对输入的每个子串，先在自动机上走到对应串的节点，然后枚举后续状态，这些状态即为SG函数对应的后继状态，求SG函数，并将结果保存，否则会超时。


//http://www.cnblogs.com/IMGavin/
//https://nanti.jisuanke.com/t/24852
#i...]]></description><category></category></item><item><title><![CDATA[hihocoder 1475数组分拆]]></title><link>https://blog.youkuaiyun.com/Nobel7889/article/details/102087636</link><guid>https://blog.youkuaiyun.com/Nobel7889/article/details/102087636</guid><author>Nobel7889</author><pubDate>Mon, 17 Apr 2017 21:18:00 +0800</pubDate><description><![CDATA[#1475 : 数组分拆




时间限制:10000ms
单点时限:1000ms
内存限制:256MB


描述
小Ho得到了一个数组作为他的新年礼物，他非常喜欢这个数组！
在仔细研究了几天之后，小Ho成功的将这个数组拆成了若干段，并且每段的和都不为0！
现在小Ho希望知道，这样的拆分方法一共有多少种？
两种拆分方法被视作不同，当且仅当数组断开的所有位置...]]></description><category></category></item><item><title><![CDATA[hihocoder  [Offer收割]编程练习赛8 矩形计数]]></title><link>https://blog.youkuaiyun.com/Nobel7889/article/details/102087634</link><guid>https://blog.youkuaiyun.com/Nobel7889/article/details/102087634</guid><author>Nobel7889</author><pubDate>Sun, 05 Mar 2017 16:11:00 +0800</pubDate><description><![CDATA[考虑k比较小，想到容斥原理，枚举，容斥求和。


//http://www.cnblogs.com/IMGavin/
#include &lt;iostream&gt;
#include &lt;stdio.h&gt;
#include &lt;cstdlib&gt;
#include &lt;cstring&gt;
#include &lt;queue&gt;
#i...]]></description><category></category></item><item><title><![CDATA[hihocoder8 [Offer收割]编程练习赛8　拆字游戏]]></title><link>https://blog.youkuaiyun.com/Nobel7889/article/details/102087633</link><guid>https://blog.youkuaiyun.com/Nobel7889/article/details/102087633</guid><author>Nobel7889</author><pubDate>Sun, 05 Mar 2017 16:08:00 +0800</pubDate><description><![CDATA[bfs

//http://www.cnblogs.com/IMGavin/
#include &lt;iostream&gt;
#include &lt;stdio.h&gt;
#include &lt;cstdlib&gt;
#include &lt;cstring&gt;
#include &lt;queue&gt;
#include &lt;vector&gt;...]]></description><category></category></item><item><title><![CDATA[hihocoder8 [Offer收割]编程练习赛8 小Ho的强迫症]]></title><link>https://blog.youkuaiyun.com/Nobel7889/article/details/102087632</link><guid>https://blog.youkuaiyun.com/Nobel7889/article/details/102087632</guid><author>Nobel7889</author><pubDate>Sun, 05 Mar 2017 16:07:00 +0800</pubDate><description><![CDATA[数学题，找循环节，枚举


//http://www.cnblogs.com/IMGavin/
#include &lt;iostream&gt;
#include &lt;stdio.h&gt;
#include &lt;cstdlib&gt;
#include &lt;cstring&gt;
#include &lt;queue&gt;
#include &lt;...]]></description><category></category></item><item><title><![CDATA[骑士共存问题(二分图最大独立集)]]></title><link>https://blog.youkuaiyun.com/Nobel7889/article/details/102087631</link><guid>https://blog.youkuaiyun.com/Nobel7889/article/details/102087631</guid><author>Nobel7889</author><pubDate>Sat, 18 Feb 2017 12:08:00 +0800</pubDate><description><![CDATA[//http://www.cnblogs.com/IMGavin/
#include &lt;iostream&gt;
#include &lt;stdio.h&gt;
#include &lt;cstdlib&gt;
#include &lt;cstring&gt;
#include &lt;queue&gt;
#include &lt;vector&gt;
#inc...]]></description><category></category></item><item><title><![CDATA[最长k可重区间集问题(费用流)]]></title><link>https://blog.youkuaiyun.com/Nobel7889/article/details/102087630</link><guid>https://blog.youkuaiyun.com/Nobel7889/article/details/102087630</guid><author>Nobel7889</author><pubDate>Sat, 18 Feb 2017 11:09:00 +0800</pubDate><description><![CDATA[//http://www.cnblogs.com/IMGavin/
#include &lt;iostream&gt;
#include &lt;stdio.h&gt;
#include &lt;cstdlib&gt;
#include &lt;cstring&gt;
#include &lt;queue&gt;
#include &lt;vector&gt;
#inc...]]></description><category></category></item><item><title><![CDATA[深海机器人问题(费用流)]]></title><link>https://blog.youkuaiyun.com/Nobel7889/article/details/102087532</link><guid>https://blog.youkuaiyun.com/Nobel7889/article/details/102087532</guid><author>Nobel7889</author><pubDate>Fri, 17 Feb 2017 22:48:00 +0800</pubDate><description><![CDATA[//http://www.cnblogs.com/IMGavin/
#include &lt;iostream&gt;
#include &lt;stdio.h&gt;
#include &lt;cstdlib&gt;
#include &lt;cstring&gt;
#include &lt;queue&gt;
#include &lt;vector&gt;
#inc...]]></description><category></category></item><item><title><![CDATA[运输问题(费用流)]]></title><link>https://blog.youkuaiyun.com/Nobel7889/article/details/102087531</link><guid>https://blog.youkuaiyun.com/Nobel7889/article/details/102087531</guid><author>Nobel7889</author><pubDate>Fri, 17 Feb 2017 20:33:00 +0800</pubDate><description><![CDATA[//http://www.cnblogs.com/IMGavin/
#include &lt;iostream&gt;
#include &lt;stdio.h&gt;
#include &lt;cstdlib&gt;
#include &lt;cstring&gt;
#include &lt;queue&gt;
#include &lt;vector&gt;
#inc...]]></description><category></category></item><item><title><![CDATA[负载平衡问题(费用流)]]></title><link>https://blog.youkuaiyun.com/Nobel7889/article/details/102087530</link><guid>https://blog.youkuaiyun.com/Nobel7889/article/details/102087530</guid><author>Nobel7889</author><pubDate>Fri, 17 Feb 2017 20:32:00 +0800</pubDate><description><![CDATA[//http://www.cnblogs.com/IMGavin/
#include &lt;iostream&gt;
#include &lt;stdio.h&gt;
#include &lt;cstdlib&gt;
#include &lt;cstring&gt;
#include &lt;queue&gt;
#include &lt;vector&gt;
#inc...]]></description><category></category></item><item><title><![CDATA[Linux 使用create_ap开热点后无法连接wifi问题的解决]]></title><link>https://blog.youkuaiyun.com/Nobel7889/article/details/102087629</link><guid>https://blog.youkuaiyun.com/Nobel7889/article/details/102087629</guid><author>Nobel7889</author><pubDate>Fri, 17 Feb 2017 19:46:00 +0800</pubDate><description><![CDATA[使用create_ap开启热点，关闭后，无法连接wifi.
使用sudo rfkill list all发现wifi没有被锁住，使用sudo service network-manager start也无法解决问题
后来使用create_ap -h查看此软件的相关帮助，其中有
--fix-unmanaged If NetworkManager shows your interfa...]]></description><category></category></item><item><title><![CDATA[汽车加油行驶问题(最短路)]]></title><link>https://blog.youkuaiyun.com/Nobel7889/article/details/102087628</link><guid>https://blog.youkuaiyun.com/Nobel7889/article/details/102087628</guid><author>Nobel7889</author><pubDate>Sun, 12 Feb 2017 23:14:00 +0800</pubDate><description><![CDATA[//http://www.cnblogs.com/IMGavin/
#include &lt;iostream&gt;
#include &lt;stdio.h&gt;
#include &lt;cstdlib&gt;
#include &lt;cstring&gt;
#include &lt;queue&gt;
#include &lt;vector&gt;
#inc...]]></description><category></category></item><item><title><![CDATA[孤岛营救问题(最短路　状态压缩)　 网络流24题]]></title><link>https://blog.youkuaiyun.com/Nobel7889/article/details/102087627</link><guid>https://blog.youkuaiyun.com/Nobel7889/article/details/102087627</guid><author>Nobel7889</author><pubDate>Sun, 12 Feb 2017 21:40:00 +0800</pubDate><description><![CDATA[状态压缩，最短路


//http://www.cnblogs.com/IMGavin/
#include &lt;iostream&gt;
#include &lt;stdio.h&gt;
#include &lt;cstdlib&gt;
#include &lt;cstring&gt;
#include &lt;queue&gt;
#include &lt;vec...]]></description><category></category></item><item><title><![CDATA[软件补丁问题(状态压缩　最短路)]]></title><link>https://blog.youkuaiyun.com/Nobel7889/article/details/102087626</link><guid>https://blog.youkuaiyun.com/Nobel7889/article/details/102087626</guid><author>Nobel7889</author><pubDate>Sun, 12 Feb 2017 16:43:00 +0800</pubDate><description><![CDATA[先状态压缩，再求费用流，但耗内存太大，改变存边方式降低内存使用。
直接求最短路即可


//http://www.cnblogs.com/IMGavin/
#include &lt;iostream&gt;
#include &lt;stdio.h&gt;
#include &lt;cstdlib&gt;
#include &lt;cstring&gt;
#inclu...]]></description><category></category></item><item><title><![CDATA[餐巾计划问题(费用流)]]></title><link>https://blog.youkuaiyun.com/Nobel7889/article/details/102087625</link><guid>https://blog.youkuaiyun.com/Nobel7889/article/details/102087625</guid><author>Nobel7889</author><pubDate>Sat, 11 Feb 2017 23:19:00 +0800</pubDate><description><![CDATA[拆点，建二分图，Ｘi表示第i天用完的餐巾，Ｙi表示第i天需要的餐巾，求费用流。


//http://www.cnblogs.com/IMGavin/
#include &lt;iostream&gt;
#include &lt;stdio.h&gt;
#include &lt;cstdlib&gt;
#include &lt;cstring&gt;
#include ...]]></description><category></category></item><item><title><![CDATA[分配问题(二部图的最佳匹配 KM) 线性规划与网络流24题]]></title><link>https://blog.youkuaiyun.com/Nobel7889/article/details/102087623</link><guid>https://blog.youkuaiyun.com/Nobel7889/article/details/102087623</guid><author>Nobel7889</author><pubDate>Fri, 10 Feb 2017 22:24:00 +0800</pubDate><description><![CDATA[//http://www.cnblogs.com/IMGavin/
#include &lt;iostream&gt;
#include &lt;stdio.h&gt;
#include &lt;cstdlib&gt;
#include &lt;cstring&gt;
#include &lt;queue&gt;
#include &lt;vector&gt;
#inc...]]></description><category></category></item><item><title><![CDATA[数字梯形问题(费用流)]]></title><link>https://blog.youkuaiyun.com/Nobel7889/article/details/102087624</link><guid>https://blog.youkuaiyun.com/Nobel7889/article/details/102087624</guid><author>Nobel7889</author><pubDate>Fri, 10 Feb 2017 22:00:00 +0800</pubDate><description><![CDATA[费用流，拆点


//http://www.cnblogs.com/IMGavin/
#include &lt;iostream&gt;
#include &lt;stdio.h&gt;
#include &lt;cstdlib&gt;
#include &lt;cstring&gt;
#include &lt;queue&gt;
#include &lt;vecto...]]></description><category></category></item><item><title><![CDATA[星际转移问题(最大流 枚举)]]></title><link>https://blog.youkuaiyun.com/Nobel7889/article/details/102087621</link><guid>https://blog.youkuaiyun.com/Nobel7889/article/details/102087621</guid><author>Nobel7889</author><pubDate>Fri, 10 Feb 2017 17:46:00 +0800</pubDate><description><![CDATA[使用并查集判断有无解，若有解枚举天数若最大流等于人数则可行。


//http://www.cnblogs.com/IMGavin/
#include &lt;iostream&gt;
#include &lt;stdio.h&gt;
#include &lt;cstdlib&gt;
#include &lt;cstring&gt;
#include &lt;queue...]]></description><category></category></item><item><title><![CDATA[方格取数问题(二分图点权最大独立集)]]></title><link>https://blog.youkuaiyun.com/Nobel7889/article/details/102087622</link><guid>https://blog.youkuaiyun.com/Nobel7889/article/details/102087622</guid><author>Nobel7889</author><pubDate>Fri, 10 Feb 2017 12:01:00 +0800</pubDate><description><![CDATA[//http://www.cnblogs.com/IMGavin/
#include &lt;iostream&gt;
#include &lt;stdio.h&gt;
#include &lt;cstdlib&gt;
#include &lt;cstring&gt;
#include &lt;queue&gt;
#include &lt;vector&gt;
#inc...]]></description><category></category></item><item><title><![CDATA[最长递增子序列问题(费用流)]]></title><link>https://blog.youkuaiyun.com/Nobel7889/article/details/102087620</link><guid>https://blog.youkuaiyun.com/Nobel7889/article/details/102087620</guid><author>Nobel7889</author><pubDate>Mon, 06 Feb 2017 18:07:00 +0800</pubDate><description><![CDATA[http://acm.nefu.edu.cn/JudgeOnline/problemShow.php?problem_id=487

费用流，每次沿着最长边增广


//http://www.cnblogs.com/IMGavin/
#include &lt;iostream&gt;
#include &lt;stdio.h&gt;
#include &lt;cstd...]]></description><category></category></item></channel></rss>