<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[desire_ing的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/desire_ing</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; desire_ing]]></copyright><item><title><![CDATA[ubuntu 16.04 配置scottransom/presto-pulsar search software]]></title><link>https://blog.youkuaiyun.com/desire_ing/article/details/75215044</link><guid>https://blog.youkuaiyun.com/desire_ing/article/details/75215044</guid><author>desire_ing</author><pubDate>Mon, 17 Jul 2017 09:54:33 +0800</pubDate><description><![CDATA[大部分操作需要用到root权限
使用以下命令获得root权限
sudo passwd root
输入root密码
su root
密码


1.所有需要用到的库和工具
 apt install python-pip python-tk vim git libfftw3-bin libfftw3-dbg libfftw3-dev libfftw3-doc libfftw3-doub]]></description><category></category></item><item><title><![CDATA[BNU 24258 Journey （LCA）]]></title><link>https://blog.youkuaiyun.com/desire_ing/article/details/48973879</link><guid>https://blog.youkuaiyun.com/desire_ing/article/details/48973879</guid><author>desire_ing</author><pubDate>Thu, 08 Oct 2015 16:16:45 +0800</pubDate><description><![CDATA[Bob has traveled to byteland, he find the N cities in byteland formed a tree structure, a tree structure is very special structure, there is exactly one path connecting each pair of nodes, and a tree ]]></description><category></category></item><item><title><![CDATA[POJ 3352 Road Construction（边的双边通）]]></title><link>https://blog.youkuaiyun.com/desire_ing/article/details/48714539</link><guid>https://blog.youkuaiyun.com/desire_ing/article/details/48714539</guid><author>desire_ing</author><pubDate>Thu, 24 Sep 2015 18:12:00 +0800</pubDate><description><![CDATA[双连通分量：对于一个无向图的子图，当删除其中任意一个点（边）后，不改变图内点的连通性，这样的子图叫做点的双连通子图。而当子图的边数达到最大时，叫做点的双连通分量。



边连通度：使一个子图不连通所需要删除的最小的边数就是该图的边连通度。



题意：给出无向图，求出至少添加几条边能使任意两点间至少有两条不同的路连接。



思路：求出双连通分量（即low[u]==low[]]></description><category></category></item><item><title><![CDATA[HDU 4612 Warm up (强连通，求树的直径）]]></title><link>https://blog.youkuaiyun.com/desire_ing/article/details/48344905</link><guid>https://blog.youkuaiyun.com/desire_ing/article/details/48344905</guid><author>desire_ing</author><pubDate>Thu, 10 Sep 2015 16:21:43 +0800</pubDate><description><![CDATA[题意：给出一个无向图，问加一条边后，最少还有几个桥。


经过缩点后的图肯定是一个树，所有树边都是桥。连接任何两个叶子结点都可以使 “从这两点到根节点之间的所有桥都消失”。
所以要想让剩下的桥最少，那么找到最长的两个树边，即找到从一个叶子结点到另一个叶子结点的最长路径（使用两次bfs），然后ans=桥的总数-直径。


ps：需要使用手动扩栈 否则会re
#pragma comme]]></description><category></category></item><item><title><![CDATA[POJ 3694 Network（强连通分量+LCA）]]></title><link>https://blog.youkuaiyun.com/desire_ing/article/details/48291839</link><guid>https://blog.youkuaiyun.com/desire_ing/article/details/48291839</guid><author>desire_ing</author><pubDate>Tue, 08 Sep 2015 15:42:53 +0800</pubDate><description><![CDATA[题意：给出一个无向图，然后多次询问，每次添加一条有向边后该图中存在多少桥。


用tarjan算法统计有多少个桥，并将这些边标记，对于每次询问，求两个点的LCA，在寻找的途中路过的边全都不是桥，所以若遇到有标记的边，则计数减一并取消标记即可（避免多次计数）。可以直接利用tarjan函数中的dfn数组来求LCA，因为dfn记录的就是每个点的访问次序。


#include
#includ]]></description><category></category></item><item><title><![CDATA[强连通相关：poj1236，poj2186，poj2762，hdu4738]]></title><link>https://blog.youkuaiyun.com/desire_ing/article/details/48212137</link><guid>https://blog.youkuaiyun.com/desire_ing/article/details/48212137</guid><author>desire_ing</author><pubDate>Fri, 04 Sep 2015 20:25:16 +0800</pubDate><description><![CDATA[相关的概念：
割边：在连通图中，删除了连通图的某条边后，图不再连通。这样的边被称为割边，也叫做桥。


割点：在连通图中，删除了连通图的某个点以及与这个点相连的边后，图不再连通。这样的点被称为割点。


对于有向图上的2个点a,b，若存在一条从a到b的路径，也存在一条从b到a的路径，那么称a,b是强连通的。


对于有向图上的一个子图，若子图内任意点对(a,b)都满足强连通，则]]></description><category></category></item><item><title><![CDATA[ZOJ 3690 Choosing number（矩阵快速幂）]]></title><link>https://blog.youkuaiyun.com/desire_ing/article/details/46982037</link><guid>https://blog.youkuaiyun.com/desire_ing/article/details/46982037</guid><author>desire_ing</author><pubDate>Tue, 21 Jul 2015 10:26:41 +0800</pubDate><description><![CDATA[Choosing number

Time Limit: 2 Seconds      Memory Limit: 65536 KB

There are n people standing in a row. And There are m numbers, 1.2...m. Every one should choose a number. But if two persons sta]]></description><category></category></item><item><title><![CDATA[ZOJ 1569 Partial Sums]]></title><link>https://blog.youkuaiyun.com/desire_ing/article/details/41807207</link><guid>https://blog.youkuaiyun.com/desire_ing/article/details/41807207</guid><author>desire_ing</author><pubDate>Mon, 08 Dec 2014 19:17:25 +0800</pubDate><description><![CDATA[Partial Sums

Time Limit: 2 Seconds      Memory Limit: 65536 KB


Given a series of n numbers a1, a2, ..., an, the partial sum of the numbers is defined as the sum of ai, ai+1, ..., aj.

You ar]]></description><category></category></item><item><title><![CDATA[HDU 3047 Zjnu Stadium（带权并查集，路径压缩）]]></title><link>https://blog.youkuaiyun.com/desire_ing/article/details/39787631</link><guid>https://blog.youkuaiyun.com/desire_ing/article/details/39787631</guid><author>desire_ing</author><pubDate>Sun, 05 Oct 2014 00:08:55 +0800</pubDate><description><![CDATA[Zjnu Stadium
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1675    Accepted Submission(s): 630



Problem Description

In 12th Zhejia]]></description><category></category></item><item><title><![CDATA[HDU 3635 Dragon Balls（带权并查集）]]></title><link>https://blog.youkuaiyun.com/desire_ing/article/details/39785531</link><guid>https://blog.youkuaiyun.com/desire_ing/article/details/39785531</guid><author>desire_ing</author><pubDate>Sat, 04 Oct 2014 23:26:48 +0800</pubDate><description><![CDATA[Dragon Balls
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3297    Accepted Submission(s): 1269



Problem Description

Five hundred ]]></description><category></category></item><item><title><![CDATA[HDU 3172 Virtual Friends（带权并查集，map)]]></title><link>https://blog.youkuaiyun.com/desire_ing/article/details/39785385</link><guid>https://blog.youkuaiyun.com/desire_ing/article/details/39785385</guid><author>desire_ing</author><pubDate>Sat, 04 Oct 2014 23:21:39 +0800</pubDate><description><![CDATA[Virtual Friends
Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 5192    Accepted Submission(s): 1447



Problem Description

These days]]></description><category></category></item><item><title><![CDATA[HDU 1856 More is better（基础并查集）]]></title><link>https://blog.youkuaiyun.com/desire_ing/article/details/39785131</link><guid>https://blog.youkuaiyun.com/desire_ing/article/details/39785131</guid><author>desire_ing</author><pubDate>Sat, 04 Oct 2014 23:13:04 +0800</pubDate><description><![CDATA[最近一直在练习图论，写了不少并查集题目，da]]></description><category></category></item><item><title><![CDATA[图论500题]]></title><link>https://blog.youkuaiyun.com/desire_ing/article/details/39737873</link><guid>https://blog.youkuaiyun.com/desire_ing/article/details/39737873</guid><author>desire_ing</author><pubDate>Thu, 02 Oct 2014 19:12:10 +0800</pubDate><description><![CDATA[=============================以下是最小生成树+并查集======================================
【HDU】
1213 How Many Tables
基础并查集★
1272 小希的迷宫 
基础并查集★
1325&&poj1308 Is It A Tree?
基础并查集★
1856 More is better
基础并]]></description><category></category></item><item><title><![CDATA[HDU 1251 统计难题（字典树模版）]]></title><link>https://blog.youkuaiyun.com/desire_ing/article/details/38498365</link><guid>https://blog.youkuaiyun.com/desire_ing/article/details/38498365</guid><author>desire_ing</author><pubDate>Mon, 11 Aug 2014 20:50:59 +0800</pubDate><description><![CDATA[刚学字典树，就是一个多条链的链表，用于]]></description><category></category></item><item><title><![CDATA[河南省第六届acm省赛 探寻宝藏&& poj 3422 （最大费用最大流）]]></title><link>https://blog.youkuaiyun.com/desire_ing/article/details/38454007</link><guid>https://blog.youkuaiyun.com/desire_ing/article/details/38454007</guid><author>desire_ing</author><pubDate>Sat, 09 Aug 2014 10:05:05 +0800</pubDate><description><![CDATA[题目描述






传说HMH大沙漠中有一个M*N迷宫，里面藏有许多宝物。某天，Dr.Kong找到了迷宫的地图，他发现迷宫内处处有宝物，最珍贵的宝物就藏在右下角，迷宫的进出口在左上角。当然，迷宫中的通路不是平坦的，到处都是陷阱。Dr.Kong决定让他的机器人卡多去探险。

但机器人卡多从左上角走到右下角时，只会向下走或者向右走。从右下角往回走到左上角时，只会向上走或者向左走，而]]></description><category></category></item><item><title><![CDATA[程序员生存定律-打造属于自己的稀缺性]]></title><link>https://blog.youkuaiyun.com/desire_ing/article/details/38435211</link><guid>https://blog.youkuaiyun.com/desire_ing/article/details/38435211</guid><author>desire_ing</author><pubDate>Fri, 08 Aug 2014 10:11:25 +0800</pubDate><description><![CDATA[现在我还是一个即将大二的]]></description><category></category></item><item><title><![CDATA[HDU 4771 Stealing Harry Potter's Precious(bfs+dfs)]]></title><link>https://blog.youkuaiyun.com/desire_ing/article/details/38434723</link><guid>https://blog.youkuaiyun.com/desire_ing/article/details/38434723</guid><author>desire_ing</author><pubDate>Fri, 08 Aug 2014 09:47:58 +0800</pubDate><description><![CDATA[Stealing Harry Potter's Precious
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1105    Accepted Submission(s): 533



Problem Descripti]]></description><category></category></item><item><title><![CDATA[acm暑假集训已经过半...]]></title><link>https://blog.youkuaiyun.com/desire_ing/article/details/38408185</link><guid>https://blog.youkuaiyun.com/desire_ing/article/details/38408185</guid><author>desire_ing</author><pubDate>Wed, 06 Aug 2014 22:46:05 +0800</pubDate><description><![CDATA[从7.17号到现在过去了一个月了，集训也过了]]></description><category></category></item><item><title><![CDATA[POJ 3254 Corn Fields（状态压缩dp）]]></title><link>https://blog.youkuaiyun.com/desire_ing/article/details/38407955</link><guid>https://blog.youkuaiyun.com/desire_ing/article/details/38407955</guid><author>desire_ing</author><pubDate>Wed, 06 Aug 2014 22:30:16 +0800</pubDate><description><![CDATA[Description

Farmer John has purchased a lush new rectangular pasture composed of M by N (1 ≤ M ≤ 12; 1 ≤ N ≤ 12) square parcels. He wants to grow some yummy corn for the cows on a number of squares]]></description><category></category></item><item><title><![CDATA[HDU 1074 Doing Homework（状态压缩dp）]]></title><link>https://blog.youkuaiyun.com/desire_ing/article/details/38407611</link><guid>https://blog.youkuaiyun.com/desire_ing/article/details/38407611</guid><author>desire_ing</author><pubDate>Wed, 06 Aug 2014 22:11:56 +0800</pubDate><description><![CDATA[Problem Description

Ignatius has just come back school from the 30th ACM/ICPC. Now he has a lot of homework to do. Every teacher gives him a deadline of handing in the homework. If Ignatius hands i]]></description><category></category></item></channel></rss>