<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[a2491411的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/a2491411</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; a2491411]]></copyright><item><title><![CDATA[最后的最后]]></title><link>https://blog.youkuaiyun.com/a2491411/article/details/101902683</link><guid>https://blog.youkuaiyun.com/a2491411/article/details/101902683</guid><author>a2491411</author><pubDate>Sat, 22 Jul 2017 23:07:00 +0800</pubDate><description><![CDATA[NOI2017 胸牌滚粗正式AFO舍友们接着离开，带着奖牌，带着协议。之前忙于交际，一直没有时间静下来思考人生。喧嚣过后内心落寞，怅然若失之感无法言喻，带着沉痛感和负罪感。就这么结束了，我之前一直觉得退役这词非常遥远，不管之前的OI生涯是否圆满，依然被强行画上了句号。不甘，非常不甘，什么牌子都没有滚回去读文化课。但说到底还是自己的锅，从NOIP开始就一直颓废至今，没有努力，更不用说尽全力...]]></description><category></category></item><item><title><![CDATA[BZOJ:1004Cards]]></title><link>https://blog.youkuaiyun.com/a2491411/article/details/101902681</link><guid>https://blog.youkuaiyun.com/a2491411/article/details/101902681</guid><author>a2491411</author><pubDate>Tue, 09 May 2017 20:55:00 +0800</pubDate><description><![CDATA[http://blog.youkuaiyun.com/yukizzz/article/details/51105009凄凄惨惨戚戚的看了两个晚上，现在还是不是很懂。果然HN的dalao们都非常熟悉那些奇奇怪怪的定理啊Burnside引理定义：设G={a1,a2,…ag}是目标集[1,n]上的置换群。每个置换都写成不相交循环的乘积。是在置换ak的作用下不动点的个数，也就是长度为1的循环的个数。...]]></description><category></category></item><item><title><![CDATA[BZOJ:1003物流运输]]></title><link>https://blog.youkuaiyun.com/a2491411/article/details/101902678</link><guid>https://blog.youkuaiyun.com/a2491411/article/details/101902678</guid><author>a2491411</author><pubDate>Sun, 07 May 2017 20:04:00 +0800</pubDate><description><![CDATA[嗷一搞又是一个晚上，其实这一题又不难。唉，看在这是一道好题的份上当然就原谅它啦。所以就是最短路+DP调了好久一直WA的原因有二1.数组开的不够大越界了ORZ2.愚蠢的区间少考虑了一种情况Through it all,through it all,my eyes are on you.Through it all,through it all,it is well.#include&...]]></description><category></category></item><item><title><![CDATA[BZOJ:1002轮状病毒]]></title><link>https://blog.youkuaiyun.com/a2491411/article/details/101902676</link><guid>https://blog.youkuaiyun.com/a2491411/article/details/101902676</guid><author>a2491411</author><pubDate>Fri, 05 May 2017 22:02:00 +0800</pubDate><description><![CDATA[这里是暴力然后据说正解是矩阵乘法，然后其实打表找规律也是可以的，用斐波那契数列搞一搞再加上高精度然后我就不想编了QwQ#include&lt;cstdio&gt; using namespace std; const int maxn=303; struct arr{int l,r;}map[maxn]; int f[maxn],N,n,i,ans; bool flag[m...]]></description><category></category></item><item><title><![CDATA[BZOJ:1001狼抓兔子]]></title><link>https://blog.youkuaiyun.com/a2491411/article/details/101902659</link><guid>https://blog.youkuaiyun.com/a2491411/article/details/101902659</guid><author>a2491411</author><pubDate>Thu, 04 May 2017 07:09:00 +0800</pubDate><description><![CDATA[简直了非常迷 看到题目毫不犹豫的写了一个网络流，然后果真就TLE了翻了一下题解，就是最大流最小割定理然后，然后将平面图变成对偶图，相当于是从起点到终点跑一个最短路就可以了神马居然还有这种操作？？！呃加边那个位置是挺复杂的，但是我写对了呀~还有一个非常迷的地方就是非要用结构体来存边吗我怎么一用数组就WA啊这是什么歪理是不是BZOJ的评测机有bug至今不知道为什么邻接表会写挂完蛋没...]]></description><category></category></item><item><title><![CDATA[zdlzxg]]></title><link>https://blog.youkuaiyun.com/a2491411/article/details/101902656</link><guid>https://blog.youkuaiyun.com/a2491411/article/details/101902656</guid><author>a2491411</author><pubDate>Tue, 02 May 2017 22:01:00 +0800</pubDate><description><![CDATA[#include&lt;cstdio&gt;#include&lt;cstring&gt;#include&lt;algorithm&gt;#include&lt;queue&gt;using namespace std;#define maxn 1007#define inf 999999999#define min(x,y) x&lt;y?x:yint n,m,temp;int ne...]]></description><category></category></item><item><title><![CDATA[赤裸裸的数学：牛顿二项公式]]></title><link>https://blog.youkuaiyun.com/a2491411/article/details/101902654</link><guid>https://blog.youkuaiyun.com/a2491411/article/details/101902654</guid><author>a2491411</author><pubDate>Fri, 28 Apr 2017 13:12:00 +0800</pubDate><description><![CDATA[转载于:https://www.cnblogs.com/OcahIBye/p/6781149.html]]></description><category></category></item><item><title><![CDATA[带花树]]></title><link>https://blog.youkuaiyun.com/a2491411/article/details/101902675</link><guid>https://blog.youkuaiyun.com/a2491411/article/details/101902675</guid><author>a2491411</author><pubDate>Fri, 21 Apr 2017 18:24:00 +0800</pubDate><description><![CDATA[全程在膜scpointer的代码，真是太强了，虽然说是看完代码才开始写的，但是一有一点点不一样就会 WA/TLE#include&lt;cstdio&gt;#include&lt;cstring&gt;#include&lt;algorithm&gt;#include&lt;queue&gt;using namespace std;#define maxn 800005int pre[...]]></description><category></category></item><item><title><![CDATA[二分图小结【从X神那里挖过来的]]></title><link>https://blog.youkuaiyun.com/a2491411/article/details/101902651</link><guid>https://blog.youkuaiyun.com/a2491411/article/details/101902651</guid><author>a2491411</author><pubDate>Thu, 20 Apr 2017 21:40:00 +0800</pubDate><description><![CDATA[概要：可以用匈牙利或者网络流（听说Dinic是O(sqrt(V)*E)，isap我不知道，大概一样吧。）应用：最大匹配、最小点覆盖、最大独立集、最小路径覆盖、二分图完美匹配等。技巧及注意：匈牙利是O(nm)的，比网络流慢。KM比网络流慢。（还是写网络流吧。。。）一些知识：二分图在X集和Y集元素不同时，又要求哪些X集中元素有且只有一个Y集中的元素与之匹配时，可以先跑二分图匹配，然后依次删边...]]></description><category></category></item><item><title><![CDATA[刷题记录:二分图]]></title><link>https://blog.youkuaiyun.com/a2491411/article/details/101902649</link><guid>https://blog.youkuaiyun.com/a2491411/article/details/101902649</guid><author>a2491411</author><pubDate>Thu, 20 Apr 2017 21:36:00 +0800</pubDate><description><![CDATA[[JSOI2009]游戏GameDescriptionInput输入数据首先输入两个整数N,M，表示了迷宫的边长。 接下来N行，每行M个字符，描述了迷宫。Output若小AA能够赢得游戏，则输出一行”WIN”，然后输出所有可以赢得游戏的起始位置，按行优先顺序输出 每行一个,否则输出一行”LOSE”（不包含引号）。Sample Input3 3.##….#.#Samp...]]></description><category></category></item><item><title><![CDATA[KM]]></title><link>https://blog.youkuaiyun.com/a2491411/article/details/101902648</link><guid>https://blog.youkuaiyun.com/a2491411/article/details/101902648</guid><author>a2491411</author><pubDate>Thu, 20 Apr 2017 14:15:00 +0800</pubDate><description><![CDATA[#include&lt;cstdio&gt;#include&lt;cstring&gt;#include&lt;algorithm&gt;#include&lt;queue&gt;#define N 405using namespace std;typedef long long ll;const int inf = 0x3f3f3f3f;inline int read(){	int ...]]></description><category></category></item><item><title><![CDATA[二分图的最大权匹配KM算法]]></title><link>https://blog.youkuaiyun.com/a2491411/article/details/101902674</link><guid>https://blog.youkuaiyun.com/a2491411/article/details/101902674</guid><author>a2491411</author><pubDate>Wed, 19 Apr 2017 22:07:00 +0800</pubDate><description><![CDATA[又搞了差不多一天，整天手残得没药可救了【摊手#include&lt;cstdio&gt;#include&lt;cstring&gt;#include&lt;algorithm&gt;#include&lt;cstdlib&gt;#include&lt;queue&gt;#define maxn 405using namespace std;const int inf=9999999...]]></description><category></category></item><item><title><![CDATA[二分图的最大匹配]]></title><link>https://blog.youkuaiyun.com/a2491411/article/details/101902669</link><guid>https://blog.youkuaiyun.com/a2491411/article/details/101902669</guid><author>a2491411</author><pubDate>Wed, 19 Apr 2017 19:07:00 +0800</pubDate><description><![CDATA[不行我要发长文吐槽一下memset，简直就是垃圾好吗，虽然我很长用，但是我今天调了两个小时，对着以前的程序找了N久的不同，wok居然就是因为我把memset(tryy,0,sizeof(tryy))写成了memset(tryy,0,sizeof(int))说好的通用呢真是好迷啊简直了#include&lt;cstdio&gt;
#include&lt;cstring&gt;
#inc...]]></description><category></category></item><item><title><![CDATA[新年的毒瘤]]></title><link>https://blog.youkuaiyun.com/a2491411/article/details/101902668</link><guid>https://blog.youkuaiyun.com/a2491411/article/details/101902668</guid><author>a2491411</author><pubDate>Wed, 19 Apr 2017 11:17:00 +0800</pubDate><description><![CDATA[虽然一看就知道是用tarjan求割点的，诶诶诶但我还是得去翻了翻题解。发现哇好妙啊，被删掉的点一定不是割点，因为删掉的话图就不连通了，但是一棵树是连通的。现在还是没有编完的。我们要找的点就是从不是割点的点里面找到边数为m-（n-2）的点 ，这真的非常显然啊，我为什么这么蠢呢还没有处理边数，mark一下，中午回来继续打。----------------------------------...]]></description><category></category></item><item><title><![CDATA[FFT]]></title><link>https://blog.youkuaiyun.com/a2491411/article/details/101902666</link><guid>https://blog.youkuaiyun.com/a2491411/article/details/101902666</guid><author>a2491411</author><pubDate>Tue, 18 Apr 2017 18:34:00 +0800</pubDate><description><![CDATA[这里是板子，虽然看懂了原理，但是代码还是好难理解哦void fft(int n,complex&lt;double&gt;*buffer,int offset,int step,complex&lt;double&gt;* epsilon)  {                                  ...]]></description><category></category></item><item><title><![CDATA[神一样的可持久化Treap模板]]></title><link>https://blog.youkuaiyun.com/a2491411/article/details/101902663</link><guid>https://blog.youkuaiyun.com/a2491411/article/details/101902663</guid><author>a2491411</author><pubDate>Mon, 17 Apr 2017 16:25:00 +0800</pubDate><description><![CDATA[第一次发现指针这么好用#include&lt;cstdio&gt;#include&lt;cstring&gt;#include&lt;algorithm&gt;#include&lt;ctime&gt;using namespace std;#define maxn 100007#define rep(i,x,y) for(int i=x;i&lt;=y;++i)struct Tre...]]></description><category></category></item><item><title><![CDATA[神奇的数组的使用方法get]]></title><link>https://blog.youkuaiyun.com/a2491411/article/details/101902667</link><guid>https://blog.youkuaiyun.com/a2491411/article/details/101902667</guid><author>a2491411</author><pubDate>Mon, 17 Apr 2017 14:54:00 +0800</pubDate><description><![CDATA[#include&lt;cstdio&gt;#include&lt;cstring&gt;int main(){	int a[10000];	scanf("%d",a);//这里相当于大小a[0]	for(int i=1;i&lt;=a[0];i++)	scanf("%d",a+i);//按顺序进行读入	for(int i=1;i&lt;=a[0];i++)	printf("%d ",a...]]></description><category></category></item><item><title><![CDATA[Treap]]></title><link>https://blog.youkuaiyun.com/a2491411/article/details/101902646</link><guid>https://blog.youkuaiyun.com/a2491411/article/details/101902646</guid><author>a2491411</author><pubDate>Mon, 17 Apr 2017 00:34:00 +0800</pubDate><description><![CDATA[粗略的试了一下，大概是没有问题的#include&lt;cstdio&gt;#include&lt;cstring&gt;#include&lt;time.h&gt;#include&lt;stdlib.h&gt;#define random(x) (rand()%x)#define maxn 100007using namespace std;int fa[maxn],son[max...]]></description><category></category></item><item><title><![CDATA[splay的区间操作]]></title><link>https://blog.youkuaiyun.com/a2491411/article/details/101902657</link><guid>https://blog.youkuaiyun.com/a2491411/article/details/101902657</guid><author>a2491411</author><pubDate>Sun, 16 Apr 2017 17:48:00 +0800</pubDate><description><![CDATA[又是一个晚上，美好的青春都用来调试了其实正解和我原来想的非常不一样，我本来是想用下标表示下标，后来突然发现不对，如果你下标不变，交换的时候只交换值的话，左右子树不一样大，就出问题了。后来就连着下标一起交换，诶诶诶那这样你怎么让我找点啊,我本身建树的时候优先级就是按照下标来的啊。后来一拍脑袋想起来中序遍历是不变的，可以通过查找siz的大小来解决原序列的下标问题，不敢相信这复杂度去翻了一下标...]]></description><category></category></item><item><title><![CDATA[【UR #2】猪猪侠再战括号序列]]></title><link>https://blog.youkuaiyun.com/a2491411/article/details/101902645</link><guid>https://blog.youkuaiyun.com/a2491411/article/details/101902645</guid><author>a2491411</author><pubDate>Sun, 16 Apr 2017 17:47:00 +0800</pubDate><description><![CDATA[---恢复内容开始--- 大概就是判断合法的括号序列的问题，进行翻转使其成为合法的括号序列。1.前缀和的做法：非常妙啊，左括号和右括号分别即为1和-1，合法的组合累加和一定为非负数，而不合法的情况就是出现了右括号在左括号前面，从出现-1，一直到下一次相加为零全部翻转我们一定能得到合法的序列。2.好像可以用dp和二位前缀和来做 不会3.用splay做，什么和什么嘛也不会 ---恢复内容结...]]></description><category></category></item></channel></rss>