<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Brushleon的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Brushleon</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Brushleon]]></copyright><item><title><![CDATA[Educational Codeforces Round 68 (Rated for Div. 2)   C-From S To T]]></title><link>https://blog.youkuaiyun.com/Brushleon/article/details/95950577</link><guid>https://blog.youkuaiyun.com/Brushleon/article/details/95950577</guid><author>Brushleon</author><pubDate>Mon, 15 Jul 2019 12:12:44 +0800</pubDate><description><![CDATA[https://codeforc.es/contest/1194/problem/C
我是个傻子，被死死的卡在测试2，没考虑s和t本来就相等的情况
#include&lt;bits/stdc++.h&gt;
using namespace std;
typedef long long ll;
const int N=100000+5;
int a[27],b[27];
int main()
{
 ...]]></description><category></category></item><item><title><![CDATA[c++ list, vector, map, set 区别与用法比较]]></title><link>https://blog.youkuaiyun.com/Brushleon/article/details/88640086</link><guid>https://blog.youkuaiyun.com/Brushleon/article/details/88640086</guid><author>Brushleon</author><pubDate>Mon, 18 Mar 2019 15:35:23 +0800</pubDate><description><![CDATA[c++ list, vector, map, set 区别与用法比较
https://www.cnblogs.com/virusolf/p/4323940.html
C++ STL快速入门——String、vector、set、list、map（都是用于存储数据）用法实例
https://blog.youkuaiyun.com/liang841451955/article/details/80404509
C...]]></description><category></category></item><item><title><![CDATA[C语言queue函数（队列）]]></title><link>https://blog.youkuaiyun.com/Brushleon/article/details/88078094</link><guid>https://blog.youkuaiyun.com/Brushleon/article/details/88078094</guid><author>Brushleon</author><pubDate>Sat, 02 Mar 2019 16:55:13 +0800</pubDate><description><![CDATA[queue&amp;nbsp;模板类的定义在&amp;lt;queue&amp;gt;头文件中。
与stack&amp;nbsp;模板类很相似，queue&amp;nbsp;模板类也需要两个模板参数，一个是元素类型，一个容器类
型，元素类型是必要的，容器类型是可选的，默认为deque 类型。
定义queue 对象的示例代码如下：
queue&amp;lt;...]]></description><category></category></item><item><title><![CDATA[并查集]]></title><link>https://blog.youkuaiyun.com/Brushleon/article/details/88034161</link><guid>https://blog.youkuaiyun.com/Brushleon/article/details/88034161</guid><author>Brushleon</author><pubDate>Thu, 28 Feb 2019 16:35:15 +0800</pubDate><description><![CDATA[例子就是杭电上的畅通工程：
http://acm.hdu.edu.cn/showproblem.php?pid=1232
首先在地图上给你若干个城镇，这些城镇都可以看作点，然后告诉你哪些对城镇之间是有道路直接相连的。最后要解决的是整幅图的连通性问题。比如随意给你两个点，让你判断它们是否连通，或者问你整幅图一共有几个连通分支，也就是被分成了几...]]></description><category></category></item><item><title><![CDATA[x&-x]]></title><link>https://blog.youkuaiyun.com/Brushleon/article/details/87923011</link><guid>https://blog.youkuaiyun.com/Brushleon/article/details/87923011</guid><author>Brushleon</author><pubDate>Mon, 25 Feb 2019 19:41:37 +0800</pubDate><description><![CDATA[-x的值即在x值的基础上按位取反（~x）再+1
x&amp;amp;-x=x&amp;amp;(~x+1)
①x为奇   1
②x为0     0
③x为偶，且x=2^m   2^m
④x为偶，且x=n*2^m     2^m
int lowbit(int x){ return x&amp;amp;-x; }

...]]></description><category></category></item></channel></rss>