<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Ra1nBow_Chan]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Ra1nBow_Chan</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Ra1nBow_Chan]]></copyright><item><title><![CDATA[差分约束小结0.0..]]></title><link>https://blog.youkuaiyun.com/Ra1nBow_Chan/article/details/52623891</link><guid>https://blog.youkuaiyun.com/Ra1nBow_Chan/article/details/52623891</guid><author>Ra1nBow_Chan</author><pubDate>Thu, 22 Sep 2016 15:58:43 +0800</pubDate><description><![CDATA[RT..]]></description><category></category></item><item><title><![CDATA[la1la1la的四连做..]]></title><link>https://blog.youkuaiyun.com/Ra1nBow_Chan/article/details/52565700</link><guid>https://blog.youkuaiyun.com/Ra1nBow_Chan/article/details/52565700</guid><author>Ra1nBow_Chan</author><pubDate>Sat, 17 Sep 2016 21:44:54 +0800</pubDate><description><![CDATA[godlike的la1la1la给我们来了一波四连做.....]]></description><category></category></item><item><title><![CDATA[liaoliao的四连做..]]></title><link>https://blog.youkuaiyun.com/Ra1nBow_Chan/article/details/52506992</link><guid>https://blog.youkuaiyun.com/Ra1nBow_Chan/article/details/52506992</guid><author>Ra1nBow_Chan</author><pubDate>Sun, 11 Sep 2016 22:25:54 +0800</pubDate><description><![CDATA[godlike的liaoliao给我们来了一波四连做..]]></description><category></category></item><item><title><![CDATA[bzoj1014: [JSOI2008]火星人prefix]]></title><link>https://blog.youkuaiyun.com/Ra1nBow_Chan/article/details/52280601</link><guid>https://blog.youkuaiyun.com/Ra1nBow_Chan/article/details/52280601</guid><author>Ra1nBow_Chan</author><pubDate>Mon, 22 Aug 2016 21:27:07 +0800</pubDate><description><![CDATA[Description 
  　　火星人最近研究了一种操作：求一个字串两个后缀的公共前缀。比方说，有这样一个字符串：madamimadam，我们将这个字符串的各个字符予以标号：序号： 1 2 3 4 5 6 7 8 9 10 11 字符 m a d a m i m a d a m 现在，火星人定义了一个函数LCQ(x, y)，表示：该字符串中第x个字符开始的字串，与该字符串中第y个字符开始的字串，两]]></description><category></category></item><item><title><![CDATA[bzoj3926: [Zjoi2015]诸神眷顾的幻想乡]]></title><link>https://blog.youkuaiyun.com/Ra1nBow_Chan/article/details/52275002</link><guid>https://blog.youkuaiyun.com/Ra1nBow_Chan/article/details/52275002</guid><author>Ra1nBow_Chan</author><pubDate>Mon, 22 Aug 2016 11:06:22 +0800</pubDate><description><![CDATA[Description 
  幽香是全幻想乡里最受人欢迎的萌妹子，这天，是幽香的2600岁生日，无数幽香的粉丝到了幽香家门前的太阳花田上来为幽香庆祝生日。  
  粉丝们非常热情，自发组织表演了一系列节目给幽香看。幽香当然也非常高兴啦。  
  这时幽香发现了一件非常有趣的事情，太阳花田有n块空地。在过去，幽香为了方便，在这n块空地之间修建了n-1条边将它们连通起来。也就是说，这n块空地形成了一个树]]></description><category></category></item><item><title><![CDATA[bzoj3238: [Ahoi2013]差异]]></title><link>https://blog.youkuaiyun.com/Ra1nBow_Chan/article/details/52249285</link><guid>https://blog.youkuaiyun.com/Ra1nBow_Chan/article/details/52249285</guid><author>Ra1nBow_Chan</author><pubDate>Fri, 19 Aug 2016 11:38:43 +0800</pubDate><description><![CDATA[Description 
  
  
  Input 
  一行，一个字符串S
  
  Output 
   一行，一个整数，表示所求值
  
  Sample Input 
  cacao
  
  Sample Output 
  54
  
  HINT 
  2<=N<=500000,S由小写英文字母组成
简单来说就是求原串中所有后缀两两最长公共前缀之和..那么只要把原串反过来做SAM，把]]></description><category></category></item><item><title><![CDATA[bzoj1396: 识别子串]]></title><link>https://blog.youkuaiyun.com/Ra1nBow_Chan/article/details/52248416</link><guid>https://blog.youkuaiyun.com/Ra1nBow_Chan/article/details/52248416</guid><author>Ra1nBow_Chan</author><pubDate>Fri, 19 Aug 2016 10:32:49 +0800</pubDate><description><![CDATA[Description 
   
  Input 
  一行,一个由小写字母组成的字符串S,长度不超过10^5  
  Output 
  L行,每行一个整数,第i行的数据表示关于S的第i个元素的最短识别子串有多长.
  
  Sample Input 
  agoodcookcooksgoodfood
  
  Sample Output 
  1 
  2 
  3 
  3 
  2 
  2]]></description><category></category></item><item><title><![CDATA[bzoj3676: [Apio2014]回文串]]></title><link>https://blog.youkuaiyun.com/Ra1nBow_Chan/article/details/52242555</link><guid>https://blog.youkuaiyun.com/Ra1nBow_Chan/article/details/52242555</guid><author>Ra1nBow_Chan</author><pubDate>Thu, 18 Aug 2016 16:52:29 +0800</pubDate><description><![CDATA[Description 
  考虑一个只包含小写拉丁字母的字符串s。我们定义s的一个子串t的“出  
  现值”为t在s中的出现次数乘以t的长度。请你求出s的所有回文子串中的最  
  大出现值。 
  
  Input 
  输入只有一行，为一个只包含小写字母(a -z)的非空字符串s。 
  
  Output 
  输出一个整数，为逝查回文子串的最大出现值。 
  
  Sample Inpu]]></description><category></category></item><item><title><![CDATA[hdu5659 CA Loves Substring]]></title><link>https://blog.youkuaiyun.com/Ra1nBow_Chan/article/details/52239417</link><guid>https://blog.youkuaiyun.com/Ra1nBow_Chan/article/details/52239417</guid><author>Ra1nBow_Chan</author><pubDate>Thu, 18 Aug 2016 11:39:17 +0800</pubDate><description><![CDATA[Problem Description 
  CA loves strings, especially the substrings. 
  Now CA has a string S which consists of N digits. However, she split this string into two non-empty strings. Specifically, CA spil]]></description><category></category></item><item><title><![CDATA[bzoj3473: 字符串]]></title><link>https://blog.youkuaiyun.com/Ra1nBow_Chan/article/details/52231927</link><guid>https://blog.youkuaiyun.com/Ra1nBow_Chan/article/details/52231927</guid><author>Ra1nBow_Chan</author><pubDate>Wed, 17 Aug 2016 16:11:31 +0800</pubDate><description><![CDATA[Description 
  给定n个字符串，询问每个字符串有多少子串（不包括空串）是所有n个字符串中至少k个字符串的子串？ 
  Input 
  第一行两个整数n，k。 
  接下来n行每行一个字符串。 
  Output 
  一行n个整数，第i个整数表示第i个字符串的答案。 
  Sample Input 
  3 1 
  abc 
  a 
  ab 
  Sample Output]]></description><category></category></item><item><title><![CDATA[bzoj3172: [Tjoi2013]单词]]></title><link>https://blog.youkuaiyun.com/Ra1nBow_Chan/article/details/52231522</link><guid>https://blog.youkuaiyun.com/Ra1nBow_Chan/article/details/52231522</guid><author>Ra1nBow_Chan</author><pubDate>Wed, 17 Aug 2016 15:39:12 +0800</pubDate><description><![CDATA[Description 
  某人读论文，一篇论文是由许多单词组成。但他发现一个单词会在论文中出现很多次，现在想知道每个单词分别在论文中出现多少次。
  
  Input 
  第一个一个整数N,表示有多少个单词，接下来N行每行一个单词。每个单词由小写字母组成，N<=200,单词长度不超过10^6
  
  Output 
  输出N个整数，第i行的数字表示第i个单词在文章中出现了多少次。]]></description><category></category></item><item><title><![CDATA[bzoj2555: SubString]]></title><link>https://blog.youkuaiyun.com/Ra1nBow_Chan/article/details/52225883</link><guid>https://blog.youkuaiyun.com/Ra1nBow_Chan/article/details/52225883</guid><author>Ra1nBow_Chan</author><pubDate>Tue, 16 Aug 2016 23:08:37 +0800</pubDate><description><![CDATA[Description 
  懒得写背景了，给你一个字符串init，要求你支持两个操作 
  (1):在当前字符串的后面插入一个字符串 
  (2):询问字符串s在当前字符串中出现了几次？(作为连续子串) 
  你必须在线支持这些操作。
  
  Input 
  第一行一个数Q表示操作个数 
  第二行一个字符串表示初始字符串init 
  接下来Q行，每行2个字符串Type,Str  
  Ty]]></description><category></category></item><item><title><![CDATA[bzoj3998: [TJOI2015]弦论]]></title><link>https://blog.youkuaiyun.com/Ra1nBow_Chan/article/details/52216738</link><guid>https://blog.youkuaiyun.com/Ra1nBow_Chan/article/details/52216738</guid><author>Ra1nBow_Chan</author><pubDate>Tue, 16 Aug 2016 08:34:46 +0800</pubDate><description><![CDATA[Description 
  对于一个给定长度为N的字符串，求它的第K小子串是什么。
  
  Input 
  第一行是一个仅由小写英文字母构成的字符串S 
  第二行为两个整数T和K，T为0则表示不同位置的相同子串算作一个。T=1则表示不同位置的相同子串算作多个。K的意义如题所述。 
  Output 
  输出仅一行，为一个数字串，为第K小的子串。如果子串数目不足K个，则输出-1
  
  S]]></description><category></category></item><item><title><![CDATA[SPOJ SUBLEX Lexicographical Substring Search]]></title><link>https://blog.youkuaiyun.com/Ra1nBow_Chan/article/details/52199744</link><guid>https://blog.youkuaiyun.com/Ra1nBow_Chan/article/details/52199744</guid><author>Ra1nBow_Chan</author><pubDate>Sat, 13 Aug 2016 15:52:43 +0800</pubDate><description><![CDATA[Description 
  Little Daniel loves to play with strings! He always finds different ways to have fun with strings! Knowing that, his friend Kinan decided to test his skills so he gave him a string S and]]></description><category></category></item><item><title><![CDATA[bzoj4516: [Sdoi2016]生成魔咒]]></title><link>https://blog.youkuaiyun.com/Ra1nBow_Chan/article/details/52198316</link><guid>https://blog.youkuaiyun.com/Ra1nBow_Chan/article/details/52198316</guid><author>Ra1nBow_Chan</author><pubDate>Sat, 13 Aug 2016 11:17:32 +0800</pubDate><description><![CDATA[Description 
  魔咒串由许多魔咒字符组成，魔咒字符可以用数字表示。例如可以将魔咒字符 1、2 拼凑起来形成一个魔咒串 [1,2]。 
  一个魔咒串 S 的非空字串被称为魔咒串 S 的生成魔咒。 
  例如 S=[1,2,1] 时，它的生成魔咒有 [1]、[2]、[1,2]、[2,1]、[1,2,1] 五种。S=[1,1,1] 时，它的生成魔咒有 [1]、 
  [1,1]、[1,1,]]></description><category></category></item><item><title><![CDATA[SPOJ NSUBSTR Substrings]]></title><link>https://blog.youkuaiyun.com/Ra1nBow_Chan/article/details/52197691</link><guid>https://blog.youkuaiyun.com/Ra1nBow_Chan/article/details/52197691</guid><author>Ra1nBow_Chan</author><pubDate>Sat, 13 Aug 2016 09:39:16 +0800</pubDate><description><![CDATA[Description 
  You are given a string S which consists of 250000 lowercase latin letters at most. We define F(x) as the maximal number of times that some string with length x appears in S. For example]]></description><category></category></item><item><title><![CDATA[SPOJ LCS2 Longest Common Substring II]]></title><link>https://blog.youkuaiyun.com/Ra1nBow_Chan/article/details/52192720</link><guid>https://blog.youkuaiyun.com/Ra1nBow_Chan/article/details/52192720</guid><author>Ra1nBow_Chan</author><pubDate>Fri, 12 Aug 2016 16:15:16 +0800</pubDate><description><![CDATA[Description 
  A string is finite sequence of characters over a non-empty finite set Σ. 
  In this problem, Σ is the set of lowercase letters. 
  Substring, also called factor, is a consecutive sequenc]]></description><category></category></item><item><title><![CDATA[SAM模板啦啦啦...]]></title><link>https://blog.youkuaiyun.com/Ra1nBow_Chan/article/details/52192651</link><guid>https://blog.youkuaiyun.com/Ra1nBow_Chan/article/details/52192651</guid><author>Ra1nBow_Chan</author><pubDate>Fri, 12 Aug 2016 16:10:12 +0800</pubDate><description><![CDATA[刚从NanoApe学来的SAM..SPOJ LCS 求两串的最长公共子串..#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
using namespace std;
const int Maxn = 250010;
int F[Maxn*2], ch[Maxn*2][26], now, tot,]]></description><category></category></item><item><title><![CDATA[bzoj2594: [Wc2006]水管局长数据加强版]]></title><link>https://blog.youkuaiyun.com/Ra1nBow_Chan/article/details/52181114</link><guid>https://blog.youkuaiyun.com/Ra1nBow_Chan/article/details/52181114</guid><author>Ra1nBow_Chan</author><pubDate>Thu, 11 Aug 2016 11:34:26 +0800</pubDate><description><![CDATA[Description 
  SC省MY市有着庞大的地下水管网络，嘟嘟是MY市的水管局长（就是管水管的啦），嘟嘟作为水管局长的工作就是：每天供水公司可能要将一定量的水从x处送往y处，嘟嘟需要为供水公司找到一条从A至B的水管的路径，接着通过信息化的控制中心通知路径上的水管进入准备送水状态，等到路径上每一条水管都准备好了，供水公司就可以开始送水了。嘟嘟一次只能处理一项送水任务，等到当前的送水任务完成了，]]></description><category></category></item><item><title><![CDATA[bzoj3669: [Noi2014]魔法森林]]></title><link>https://blog.youkuaiyun.com/Ra1nBow_Chan/article/details/52169275</link><guid>https://blog.youkuaiyun.com/Ra1nBow_Chan/article/details/52169275</guid><author>Ra1nBow_Chan</author><pubDate>Wed, 10 Aug 2016 10:47:09 +0800</pubDate><description><![CDATA[Description 
  为了得到书法大家的真传，小E同学下定决心去拜访住在魔法森林中的隐士。魔法森林可以被看成一个包含个N节点M条边的无向图，节点标号为1..N，边标号为1..M。初始时小E同学在号节点1，隐士则住在号节点N。小E需要通过这一片魔法森林，才能够拜访到隐士。 
  魔法森林中居住了一些妖怪。每当有人经过一条边的时候，这条边上的妖怪就会对其发起攻击。幸运的是，在号节点住着两种守护精]]></description><category></category></item></channel></rss>