<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[thunderMrbird的博客]]></title><description><![CDATA[宠辱不惊,静观堂前花开花落;去留无意,漫随天外云卷云舒。]]></description><link>https://blog.youkuaiyun.com/thunderMrbird</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; thunderMrbird]]></copyright><item><title><![CDATA[poj1987 Distance Statistics 树的分治]]></title><link>https://blog.youkuaiyun.com/thunderMrbird/article/details/52297830</link><guid>https://blog.youkuaiyun.com/thunderMrbird/article/details/52297830</guid><author>thunderMrbird</author><pubDate>Wed, 24 Aug 2016 10:54:05 +0800</pubDate><description><![CDATA[Description

Frustrated at the number of distance queries required to find a reasonable route for his cow marathon, FJ decides to ask queries from which he can learn more information. Specifically, ]]></description><category></category></item><item><title><![CDATA[poj2594 经处理后的最小路径覆盖]]></title><link>https://blog.youkuaiyun.com/thunderMrbird/article/details/52291450</link><guid>https://blog.youkuaiyun.com/thunderMrbird/article/details/52291450</guid><author>thunderMrbird</author><pubDate>Tue, 23 Aug 2016 15:46:58 +0800</pubDate><description><![CDATA[题目描述：
给你一个有向无环图，有n个点，m条有向边。
一个机器人可以从任意点开始沿着边的方向走下去。对于每一个机器人：走过的点不能再走过。
问你最少用几个机器人可以走完所有的n个点，不同的机器人可以走相同的点。
可以看出这题类似于经典的最小路径覆盖。（注意最小路径覆盖和最小边覆盖的区别）只不过多了一个条件就是可以多个机器人访问同一个点。
思路也和之前一样，建图找最大匹配数，这时问题来了]]></description><category></category></item><item><title><![CDATA[算法讲解：二分图匹配]]></title><link>https://blog.youkuaiyun.com/thunderMrbird/article/details/52231639</link><guid>https://blog.youkuaiyun.com/thunderMrbird/article/details/52231639</guid><author>thunderMrbird</author><pubDate>Tue, 23 Aug 2016 10:17:36 +0800</pubDate><description><![CDATA[二分图匹配，自然要先从定义入手，那么二分图是什么呢？
二分图：
二分图又称作二部图，是图论中的一种特殊模型。 设G=(V,E)是一个无向图，如果顶点V可分割为两个互不相交的子集(A,B)，并且图中的每条边（i，j）所关联的两个顶点i和j分别属于这两个不同的顶点集(i
 in A,j in B)，则称图G为一个二分图。
简单的说，一个图被分成了两部分，相同的部分没有边，那这个图就是二分图，二]]></description><category></category></item><item><title><![CDATA[hdu1281 棋盘游戏 二分图匹配]]></title><link>https://blog.youkuaiyun.com/thunderMrbird/article/details/52262265</link><guid>https://blog.youkuaiyun.com/thunderMrbird/article/details/52262265</guid><author>thunderMrbird</author><pubDate>Sat, 20 Aug 2016 17:05:27 +0800</pubDate><description><![CDATA[Description

小希和Gardon在玩一个游戏：对一个N*M的棋盘，在格子里放尽量多的一些国际象棋里面的“车”，并且使得他们不能互相攻击，这当然很简单，但是Gardon限制了只有某些格子才可以放，小希还是很轻松的解决了这个问题（见下图）注意不能放车的地方不影响车的互相攻击。 
所以现在Gardon想让小希来解决一个更难的问题，在保证尽量多的“车”的前提下，棋盘里有些格子是可以避开的]]></description><category></category></item><item><title><![CDATA[hdu2255 奔小康赚大钱，二分图最优匹配km模板]]></title><link>https://blog.youkuaiyun.com/thunderMrbird/article/details/52261870</link><guid>https://blog.youkuaiyun.com/thunderMrbird/article/details/52261870</guid><author>thunderMrbird</author><pubDate>Sat, 20 Aug 2016 16:05:32 +0800</pubDate><description><![CDATA[Description

传说在遥远的地方有一个非常富裕的村落,有一天,村长决定进行制度改革：重新分配房子。 
这可是一件大事,关系到人民的住房问题啊。村里共有n间房间,刚好有n家老百姓,考虑到每家都要有房住（如果有老百姓没房子住的话，容易引起不安定因素），每家必须分配到一间房子且只能得到一间房子。 
另一方面,村长和另外的村领导希望得到最大的效益,这样村里的机构才会有钱.由于老百姓都比较]]></description><category></category></item><item><title><![CDATA[hdu2444 二分图匹配（判断二分图）]]></title><link>https://blog.youkuaiyun.com/thunderMrbird/article/details/52260146</link><guid>https://blog.youkuaiyun.com/thunderMrbird/article/details/52260146</guid><author>thunderMrbird</author><pubDate>Sat, 20 Aug 2016 11:13:08 +0800</pubDate><description><![CDATA[Description

There are a group of students. Some of them may know each other, while others don't. For example, A and B know each other, B and C know each other. But this may not imply that A and C k]]></description><category></category></item><item><title><![CDATA[UVA 10163 Storage Keepers 两次dp]]></title><link>https://blog.youkuaiyun.com/thunderMrbird/article/details/52239139</link><guid>https://blog.youkuaiyun.com/thunderMrbird/article/details/52239139</guid><author>thunderMrbird</author><pubDate>Thu, 18 Aug 2016 11:28:33 +0800</pubDate><description><![CDATA[Randy Company has N (1 ≤ N ≤ 100) storages. Company wants some men to keep them safe. Now
there are M (1 ≤ M ≤ 30) men asking for the job. Company will choose several from them. Randy
Company employ]]></description><category></category></item><item><title><![CDATA[hdu3549 网络流ek模板]]></title><link>https://blog.youkuaiyun.com/thunderMrbird/article/details/52231484</link><guid>https://blog.youkuaiyun.com/thunderMrbird/article/details/52231484</guid><author>thunderMrbird</author><pubDate>Wed, 17 Aug 2016 15:37:30 +0800</pubDate><description><![CDATA[Description

Network flow is a well-known difficult problem for ACMers. Given a graph, your task is to find out the maximum flow for the weighted directed graph.




Input

The first line of ]]></description><category></category></item><item><title><![CDATA[hdu5093 Battle ships 二分图匹配]]></title><link>https://blog.youkuaiyun.com/thunderMrbird/article/details/52229737</link><guid>https://blog.youkuaiyun.com/thunderMrbird/article/details/52229737</guid><author>thunderMrbird</author><pubDate>Wed, 17 Aug 2016 13:49:28 +0800</pubDate><description><![CDATA[Description

Dear contestant, now you are an excellent navy commander, who is responsible of a tough mission currently. 

Your fleet unfortunately encountered an enemy fleet near the South Pole wh]]></description><category></category></item><item><title><![CDATA[算法讲解：ac自动机及简单衍生]]></title><link>https://blog.youkuaiyun.com/thunderMrbird/article/details/52084751</link><guid>https://blog.youkuaiyun.com/thunderMrbird/article/details/52084751</guid><author>thunderMrbird</author><pubDate>Mon, 08 Aug 2016 13:36:10 +0800</pubDate><description><![CDATA[AC自动机简介： 


首先简要介绍一下AC自动机：Aho-Corasick automation，该算法在1975年产生于贝尔实验室，是著名的多模匹配算法之一。一个常见的例子就是给出n个单词，再给出一段包含m个字符的文章，让你找出有多少个单词在文章里出现过。嗯没错，比如word文档等一系列带有查找功能的东西一般用的都是这种东西啦。要搞懂AC自动机，先得有字典树Trie和KMP模式匹配算法的]]></description><category></category></item><item><title><![CDATA[hdu1247 Hat's words trie树]]></title><link>https://blog.youkuaiyun.com/thunderMrbird/article/details/52065379</link><guid>https://blog.youkuaiyun.com/thunderMrbird/article/details/52065379</guid><author>thunderMrbird</author><pubDate>Fri, 29 Jul 2016 15:23:08 +0800</pubDate><description><![CDATA[Description

A hat’s word is a word in the dictionary that is the concatenation of exactly two other words in the dictionary. 
You are to find all the hat’s words in a dictionary. 

 




In]]></description><category></category></item><item><title><![CDATA[hdu3592 差分约束问题]]></title><link>https://blog.youkuaiyun.com/thunderMrbird/article/details/52064770</link><guid>https://blog.youkuaiyun.com/thunderMrbird/article/details/52064770</guid><author>thunderMrbird</author><pubDate>Fri, 29 Jul 2016 14:35:48 +0800</pubDate><description><![CDATA[Description

Nowadays, many people want to go to Shanghai to visit the World Exhibition. So there are always a lot of people who are standing along a straight line waiting for entering. Assume that ]]></description><category></category></item><item><title><![CDATA[hdu1811 并查集+拓扑排序]]></title><link>https://blog.youkuaiyun.com/thunderMrbird/article/details/52062713</link><guid>https://blog.youkuaiyun.com/thunderMrbird/article/details/52062713</guid><author>thunderMrbird</author><pubDate>Fri, 29 Jul 2016 11:02:35 +0800</pubDate><description><![CDATA[Description

自从Lele开发了Rating系统，他的Tetris事业更是如虎添翼，不久他遍把这个游戏推向了全球。 

为了更好的符合那些爱好者的喜好，Lele又想了一个新点子：他将制作一个全球Tetris高手排行榜，定时更新，名堂要比福布斯富豪榜还响。关于如何排名，这个不用说都知道是根据Rating从高到低来排，如果两个人具有相同的Rating，那就按这几个人的RP从高到低来]]></description><category></category></item><item><title><![CDATA[hdu2222 ac自动机模版]]></title><link>https://blog.youkuaiyun.com/thunderMrbird/article/details/52049217</link><guid>https://blog.youkuaiyun.com/thunderMrbird/article/details/52049217</guid><author>thunderMrbird</author><pubDate>Wed, 27 Jul 2016 20:35:39 +0800</pubDate><description><![CDATA[Description

In the modern time, Search engine came into the life of everybody like Google, Baidu, etc. 
Wiskey also wants to bring this feature to his image retrieval system. 
Every image have a ]]></description><category></category></item><item><title><![CDATA[poj3461Oulipo kmp]]></title><link>https://blog.youkuaiyun.com/thunderMrbird/article/details/52048574</link><guid>https://blog.youkuaiyun.com/thunderMrbird/article/details/52048574</guid><author>thunderMrbird</author><pubDate>Wed, 27 Jul 2016 19:25:32 +0800</pubDate><description><![CDATA[Description


The French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter 'e'. He was a member of the Oulipo group. A quote from the book:

Tout avait Pair n]]></description><category></category></item><item><title><![CDATA[poj1094 拓扑排序（屎）]]></title><link>https://blog.youkuaiyun.com/thunderMrbird/article/details/52043696</link><guid>https://blog.youkuaiyun.com/thunderMrbird/article/details/52043696</guid><author>thunderMrbird</author><pubDate>Wed, 27 Jul 2016 11:10:50 +0800</pubDate><description><![CDATA[An ascending sorted sequence of distinct values is one in which some form of a less-than operator is used to order the elements
 from smallest to largest. For example, the sorted sequence A, B, C, D]]></description><category></category></item><item><title><![CDATA[uva10305 拓扑排序]]></title><link>https://blog.youkuaiyun.com/thunderMrbird/article/details/52037457</link><guid>https://blog.youkuaiyun.com/thunderMrbird/article/details/52037457</guid><author>thunderMrbird</author><pubDate>Tue, 26 Jul 2016 16:56:04 +0800</pubDate><description><![CDATA[John has n tasks to do. Unfortunately, the tasks are not independent and the execution of one task isonly possible if other tasks have already been executed.
题干很短，意思很简单，拓扑排序。
我的方法是用队列做，将入度为零的点进队，每次出]]></description><category></category></item><item><title><![CDATA[hdu3062 2-sat]]></title><link>https://blog.youkuaiyun.com/thunderMrbird/article/details/52036847</link><guid>https://blog.youkuaiyun.com/thunderMrbird/article/details/52036847</guid><author>thunderMrbird</author><pubDate>Tue, 26 Jul 2016 16:11:59 +0800</pubDate><description><![CDATA[Description

有n对夫妻被邀请参加一个聚会，因为场地的问题，每对夫妻中只有1人可以列席。在2n 个人中，某些人之间有着很大的矛盾（当然夫妻之间是没有矛盾的），有矛盾的2个人是不会同时出现在聚会上的。有没有可能会有n 个人同时列席？
 




Input

n： 表示有n对夫妻被邀请 (n
m： 表示有m 对矛盾关系 ( m 

在接下来的m行中，每行会有4个]]></description><category></category></item><item><title><![CDATA[hdu4405 概率dp]]></title><link>https://blog.youkuaiyun.com/thunderMrbird/article/details/52036694</link><guid>https://blog.youkuaiyun.com/thunderMrbird/article/details/52036694</guid><author>thunderMrbird</author><pubDate>Tue, 26 Jul 2016 15:58:48 +0800</pubDate><description><![CDATA[Description

Hzz loves aeroplane chess very much. The chess map contains N+1 grids labeled from 0 to N. Hzz starts at grid 0. For each step he throws a dice(a dice have six faces with equal probabil]]></description><category></category></item><item><title><![CDATA[hdu4422 The Little Girl who Picks Mushrooms 暴力]]></title><link>https://blog.youkuaiyun.com/thunderMrbird/article/details/52034228</link><guid>https://blog.youkuaiyun.com/thunderMrbird/article/details/52034228</guid><author>thunderMrbird</author><pubDate>Tue, 26 Jul 2016 11:35:54 +0800</pubDate><description><![CDATA[It's yet another festival season in Gensokyo. Little girl Alice planned to pick mushrooms in five mountains. She brought five bags with her and used different bags to collect mushrooms from different]]></description><category></category></item></channel></rss>