<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[umalaka的博客]]></title><description><![CDATA[仅用于个人知识梳理]]></description><link>https://blog.youkuaiyun.com/acdalao</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; acdalao]]></copyright><item><title><![CDATA[线性基例题]]></title><link>https://blog.youkuaiyun.com/acdalao/article/details/99699718</link><guid>https://blog.youkuaiyun.com/acdalao/article/details/99699718</guid><author>acdalao</author><pubDate>Tue, 13 Aug 2019 00:24:43 +0800</pubDate><description><![CDATA[最大异或和，第k小异或和

最大异或和
12345678910111213141516171819202122232425262728293031323334353637383940414243#include&lt;bits/stdc++.h&gt;#define INIT(a,b) memset(a,b,sizeof(a))#d...]]></description><category></category></item><item><title><![CDATA[进阶训练-数论]]></title><link>https://blog.youkuaiyun.com/acdalao/article/details/99700007</link><guid>https://blog.youkuaiyun.com/acdalao/article/details/99700007</guid><author>acdalao</author><pubDate>Mon, 12 Aug 2019 14:16:04 +0800</pubDate><description><![CDATA[&gt;
质数

对于一个足够大的整数N，不超过N的质数大约有N/lnN个；
求出L，R(1&lt;=L&lt;=R&lt;=2^31,R-L&lt;=1e6)之间相邻两个质数的差的最大值是多少。解：筛出2~sqrt(R)间所有的素数，用这些素数筛掉[L,R]之间的合数，然后扫描即可。
将N!分解质因数。解：N！的每个质因子都不会超过...]]></description><category></category></item><item><title><![CDATA[进阶训练-基本算法]]></title><link>https://blog.youkuaiyun.com/acdalao/article/details/99131398</link><guid>https://blog.youkuaiyun.com/acdalao/article/details/99131398</guid><author>acdalao</author><pubDate>Sat, 10 Aug 2019 20:32:44 +0800</pubDate><description><![CDATA[位运算，递推与递归，前缀和与差分，二分，排序，倍增，贪心
位运算移位运算
快速幂，快速乘（1e18），状态压缩，成对变换，lowbit。12345678910//快速乘ll mul(ll a,ll b,ll p){    ll ans=0;    while(b){        if(b&amp;1) a=(ans+a)%p;  ...]]></description><category></category></item><item><title><![CDATA[进阶训练-基本数据结构]]></title><link>https://blog.youkuaiyun.com/acdalao/article/details/99131426</link><guid>https://blog.youkuaiyun.com/acdalao/article/details/99131426</guid><author>acdalao</author><pubDate>Sat, 10 Aug 2019 08:46:09 +0800</pubDate><description><![CDATA[单调栈，单调队列，双端队列，邻接表，Hash，字符串，trie
单调栈
借助单调性处理问题的思想在于及时排除不可能的选项，保证策略集合的高度有效性和秩序性，从而为我们做出的决策提供更多的条件和可能方法。例题：直方图的最大矩形面积


单调队列

同单调栈一样，也是在决策集合中及时排除一定不是最优解的选择，是优化动态规划的一个重要手段...]]></description><category></category></item><item><title><![CDATA[进阶练习-搜索]]></title><link>https://blog.youkuaiyun.com/acdalao/article/details/99131383</link><guid>https://blog.youkuaiyun.com/acdalao/article/details/99131383</guid><author>acdalao</author><pubDate>Sat, 10 Aug 2019 03:43:27 +0800</pubDate><description><![CDATA[树与图的遍历，DFS，剪枝，迭代加深，BFS，双端队列BFS，优先队列BFS，A，K短路，IDA
树与图的遍历

DFS序：每个节点x的编号在序列中恰好出现两次。设这两次出现的位置为L[x]和R[x]，那么闭区间[L[x],R[x]]就以x为根的子树的DFS序。
树的重心，树的深度，图的连通块划分
拓扑排序：拓扑排序可以判定有向图是否...]]></description><category></category></item><item><title><![CDATA[Kth number———主席树模板]]></title><link>https://blog.youkuaiyun.com/acdalao/article/details/99131367</link><guid>https://blog.youkuaiyun.com/acdalao/article/details/99131367</guid><author>acdalao</author><pubDate>Sat, 27 Jul 2019 13:30:22 +0800</pubDate><description><![CDATA[传送门HDU2665描述
Give you a sequence and ask you the kth big number of a inteval.

输入
The first line is the number of the test cases.For each test case, the first line cont...]]></description><category></category></item><item><title><![CDATA[Keen On Everything But Triangle——主席树]]></title><link>https://blog.youkuaiyun.com/acdalao/article/details/99131303</link><guid>https://blog.youkuaiyun.com/acdalao/article/details/99131303</guid><author>acdalao</author><pubDate>Sat, 27 Jul 2019 09:24:10 +0800</pubDate><description><![CDATA[传送门HDU6601描述
N sticks are arranged in a row, and their lengths are a1,a2,…,aN.There are Q querys. For i-th of them, you can only use sticks between li-th to ri-th. Plea...]]></description><category></category></item><item><title><![CDATA[luogu P2617——树状数组套主席树]]></title><link>https://blog.youkuaiyun.com/acdalao/article/details/99131403</link><guid>https://blog.youkuaiyun.com/acdalao/article/details/99131403</guid><author>acdalao</author><pubDate>Sat, 27 Jul 2019 05:47:42 +0800</pubDate><description><![CDATA[传送门luogu P2617描述
给定一个含有n个数的序列a[1],a[2],a[3]……a[n]，程序必须回答这样的询问：对于给定的i,j,k，在a[i],a[i+1],a[i+2]……a[j]中第k小的数是多少(1≤k≤j-i+1)，并且，你可以改变一些a[i]的值，改变后，程序还能针对改变后的a继续回答上面的问题。你需要编一个这...]]></description><category></category></item><item><title><![CDATA[Atlantis(扫描线面积并)]]></title><link>https://blog.youkuaiyun.com/acdalao/article/details/97575367</link><guid>https://blog.youkuaiyun.com/acdalao/article/details/97575367</guid><author>acdalao</author><pubDate>Wed, 24 Jul 2019 14:23:58 +0800</pubDate><description><![CDATA[传送门 HDU1542描述
There are several ancient Greek texts that contain descriptions of the fabled island Atlantis. Some of these texts even include maps of parts of the islan...]]></description><category></category></item><item><title><![CDATA[Picture(扫描线周长并)]]></title><link>https://blog.youkuaiyun.com/acdalao/article/details/97575351</link><guid>https://blog.youkuaiyun.com/acdalao/article/details/97575351</guid><author>acdalao</author><pubDate>Wed, 24 Jul 2019 06:04:25 +0800</pubDate><description><![CDATA[传送门 HDU1828描述
A number of rectangular posters, photographs and other pictures of the same shape are pasted on a wall. Their sides are all vertical or horizontal. Each r...]]></description><category></category></item><item><title><![CDATA[Farming(扫描线体积并)]]></title><link>https://blog.youkuaiyun.com/acdalao/article/details/97575409</link><guid>https://blog.youkuaiyun.com/acdalao/article/details/97575409</guid><author>acdalao</author><pubDate>Wed, 24 Jul 2019 02:18:22 +0800</pubDate><description><![CDATA[传送门 HDU3255描述
You have a big farm, and you want to grow vegetables in it. You’re too lazy to seed the seeds yourself, so you’ve hired n people to do the job for you.Eac...]]></description><category></category></item><item><title><![CDATA[Pots]]></title><link>https://blog.youkuaiyun.com/acdalao/article/details/96651046</link><guid>https://blog.youkuaiyun.com/acdalao/article/details/96651046</guid><author>acdalao</author><pubDate>Sun, 14 Jul 2019 23:06:17 +0800</pubDate><description><![CDATA[传送门POJ3414描述
You are given two pots, having the volume of A and B liters respectively. The following operations can be performed:

FILL(i)        fill the pot i (1 ≤ i ...]]></description><category></category></item><item><title><![CDATA[Magic Cube]]></title><link>https://blog.youkuaiyun.com/acdalao/article/details/96650777</link><guid>https://blog.youkuaiyun.com/acdalao/article/details/96650777</guid><author>acdalao</author><pubDate>Sun, 14 Jul 2019 21:52:07 +0800</pubDate><description><![CDATA[传送门ZOJ2477描述
This is a very popular game for children. In this game, there’s a cube, which consists of 3  3  3 small cubes. We can unwrap the cube, it will become like ...]]></description><category></category></item><item><title><![CDATA[Gap]]></title><link>https://blog.youkuaiyun.com/acdalao/article/details/96650765</link><guid>https://blog.youkuaiyun.com/acdalao/article/details/96650765</guid><author>acdalao</author><pubDate>Sun, 14 Jul 2019 14:19:36 +0800</pubDate><description><![CDATA[传送门HDU1067描述
Let’s play a card game called Gap.You have 28 cards labeled with two-digit numbers. The first digit (from 1 to 4) represents the suit of the card, and the ...]]></description><category></category></item><item><title><![CDATA[Travelling(三进制状压dp)]]></title><link>https://blog.youkuaiyun.com/acdalao/article/details/96650752</link><guid>https://blog.youkuaiyun.com/acdalao/article/details/96650752</guid><author>acdalao</author><pubDate>Sun, 14 Jul 2019 13:58:25 +0800</pubDate><description><![CDATA[传送门HDU3001描述
After coding so many days,Mr Acmer wants to have a good rest.So travelling is the best choice!He has decided to visit n cities(he insists on seeing all the...]]></description><category></category></item><item><title><![CDATA[DNA Sequence(IDA*,迭代深搜)]]></title><link>https://blog.youkuaiyun.com/acdalao/article/details/96650806</link><guid>https://blog.youkuaiyun.com/acdalao/article/details/96650806</guid><author>acdalao</author><pubDate>Sun, 14 Jul 2019 12:58:25 +0800</pubDate><description><![CDATA[传送门HDU1560描述
The twenty-first century is a biology-technology developing century. We know that a gene is made of DNA. The nucleotide bases from which DNA is built are A...]]></description><category></category></item><item><title><![CDATA[Fire Game(双起点BFS)]]></title><link>https://blog.youkuaiyun.com/acdalao/article/details/96651039</link><guid>https://blog.youkuaiyun.com/acdalao/article/details/96651039</guid><author>acdalao</author><pubDate>Sun, 14 Jul 2019 08:03:32 +0800</pubDate><description><![CDATA[传送门FZU2150描述
Fat brother and Maze are playing a kind of special (hentai) game on an N*M board (N rows, M columns). At the beginning, each grid of this board is consisti...]]></description><category></category></item><item><title><![CDATA[Eight2]]></title><link>https://blog.youkuaiyun.com/acdalao/article/details/96650788</link><guid>https://blog.youkuaiyun.com/acdalao/article/details/96650788</guid><author>acdalao</author><pubDate>Sun, 14 Jul 2019 06:32:08 +0800</pubDate><description><![CDATA[传送门HDU3567描述
Eight-puzzle, which is also called “Nine grids”, comes from an old game.In this game, you are given a 3 by 3 board and 8 tiles. The tiles are numbered from...]]></description><category></category></item><item><title><![CDATA[Escape]]></title><link>https://blog.youkuaiyun.com/acdalao/article/details/96650883</link><guid>https://blog.youkuaiyun.com/acdalao/article/details/96650883</guid><author>acdalao</author><pubDate>Sun, 14 Jul 2019 05:17:04 +0800</pubDate><description><![CDATA[传送门HDU3533描述
The students of the HEU are maneuvering for their military training.The red army and the blue army are at war today. The blue army finds that Little A is t...]]></description><category></category></item><item><title><![CDATA[Fliptile]]></title><link>https://blog.youkuaiyun.com/acdalao/article/details/96651065</link><guid>https://blog.youkuaiyun.com/acdalao/article/details/96651065</guid><author>acdalao</author><pubDate>Sun, 14 Jul 2019 04:23:21 +0800</pubDate><description><![CDATA[传送门POJ3279描述
Farmer John knows that an intellectually satisfied cow is a happy cow who will give more milk. He has arranged a brainy activity for cows in which they man...]]></description><category></category></item></channel></rss>