<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[ch_huibw的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/ch_huibw</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; ch_huibw]]></copyright><item><title><![CDATA[【Unity3D】 MonoBehaviour生命周期]]></title><link>https://blog.youkuaiyun.com/ch_huibw/article/details/127329287</link><guid>https://blog.youkuaiyun.com/ch_huibw/article/details/127329287</guid><author>ch_huibw</author><pubDate>Fri, 14 Oct 2022 23:59:27 +0800</pubDate><description><![CDATA[Unity3D MonoBehaviour生命周期]]></description><category></category></item><item><title><![CDATA[线段树区间和模板]]></title><link>https://blog.youkuaiyun.com/ch_huibw/article/details/105035318</link><guid>https://blog.youkuaiyun.com/ch_huibw/article/details/105035318</guid><author>ch_huibw</author><pubDate>Thu, 02 Apr 2020 14:30:28 +0800</pubDate><description><![CDATA[#include&lt;iostream&gt;
#include&lt;algorithm&gt;
#include&lt;cstdio&gt;
#include&lt;cmath&gt;
#define ll long long
#define fori for(i=0;i&lt;n;i++)
#define fori1 for(i=1;i&lt;=n;i++)
using namespace...]]></description><category></category></item><item><title><![CDATA[LCA模板]]></title><link>https://blog.youkuaiyun.com/ch_huibw/article/details/105269169</link><guid>https://blog.youkuaiyun.com/ch_huibw/article/details/105269169</guid><author>ch_huibw</author><pubDate>Thu, 02 Apr 2020 14:29:35 +0800</pubDate><description><![CDATA[#include &lt;iostream&gt;
#include &lt;string.h&gt;
#include &lt;string&gt;
#include &lt;vector&gt;
#include &lt;set&gt;
#include &lt;map&gt;
#include &lt;queue&gt;
#include &lt;stack&gt;
#include &lt...]]></description><category></category></item><item><title><![CDATA[CodeForces 15C Industrial Nim 博弈论]]></title><link>https://blog.youkuaiyun.com/ch_huibw/article/details/105267998</link><guid>https://blog.youkuaiyun.com/ch_huibw/article/details/105267998</guid><author>ch_huibw</author><pubDate>Thu, 02 Apr 2020 13:52:54 +0800</pubDate><description><![CDATA[题意：NIM博弈变形，第一行给出N表示有N个采石场，接下来N行每一行一个Xi一个Mi,表示第i个采石场有Mi量车，第1辆车的石头量是Xi，第二是Xi+1，第Mi辆车的石头的数量是Xi+Mi-1。有两个人玩nim博弈，最后一个取完的赢，先手赢输出tolik，后手赢输出bolik。
思路：遍历所有的石头堆是不可能的，但你会发现每个采石场都是1个个递增的，这时假设石头量为n且n为偶数时，与n+1异或就会...]]></description><category></category></item><item><title><![CDATA[cf模板题（一直更新）]]></title><link>https://blog.youkuaiyun.com/ch_huibw/article/details/105208423</link><guid>https://blog.youkuaiyun.com/ch_huibw/article/details/105208423</guid><author>ch_huibw</author><pubDate>Mon, 30 Mar 2020 22:29:53 +0800</pubDate><description><![CDATA[尺取法裸题 676c Vasya and String
树状数组裸题 121E - Lucky Array
2-sat裸题 875C. National Property
二分裸题 706B Interesting drink
强连通裸题 475B Strongly Connected City
矩阵快速幂裸题 450B Jzzhu and Sequences
Trie树裸题 633C Spy S...]]></description><category></category></item><item><title><![CDATA[Ubiquitous Religions POJ - 2524 并查集]]></title><link>https://blog.youkuaiyun.com/ch_huibw/article/details/105098104</link><guid>https://blog.youkuaiyun.com/ch_huibw/article/details/105098104</guid><author>ch_huibw</author><pubDate>Wed, 25 Mar 2020 16:24:16 +0800</pubDate><description><![CDATA[Ubiquitous Religions POJ - 2524
并查集
#include&lt;iostream&gt;
#include&lt;algorithm&gt;
#define fori for(i=0;i&lt;n;i++)
#define fori1 for(i=1;i&lt;=n;i++)
#define ll long long
const ll mod = 1e9 + 7;
...]]></description><category></category></item><item><title><![CDATA[The Suspects POJ - 1611 并查集]]></title><link>https://blog.youkuaiyun.com/ch_huibw/article/details/105095591</link><guid>https://blog.youkuaiyun.com/ch_huibw/article/details/105095591</guid><author>ch_huibw</author><pubDate>Wed, 25 Mar 2020 15:07:05 +0800</pubDate><description><![CDATA[The Suspects POJ - 1611
知识点：并查集
我这里把查询和合并进行了优化，喜欢的话可以拿来当模板
在这里插入代码片#include&lt;iostream&gt;
#include&lt;algorithm&gt;
#define fori for(i=0;i&lt;n;i++)
#define fori1 for(i=1;i&lt;=n;i++)
#define ll lon...]]></description><category></category></item><item><title><![CDATA[线段树区间乘积算法]]></title><link>https://blog.youkuaiyun.com/ch_huibw/article/details/105035459</link><guid>https://blog.youkuaiyun.com/ch_huibw/article/details/105035459</guid><author>ch_huibw</author><pubDate>Sun, 22 Mar 2020 21:26:32 +0800</pubDate><description><![CDATA[这是算区间乘积的算法
#include&lt;iostream&gt;
#include&lt;algorithm&gt;
#include&lt;cstdio&gt;
#include&lt;cmath&gt;
#define ll long long
#define fori for(i=0;i&lt;n;i++)
#define fori1 for(i=1;i&lt;=n;i++)
usin...]]></description><category></category></item></channel></rss>