<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[VisJiao的博客]]></title><description><![CDATA[瞬光斩黯黮，昭明破晦夜。]]></description><link>https://blog.youkuaiyun.com/VicJiao</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; VicJiao]]></copyright><item><title><![CDATA[本博客已转移至博客园]]></title><link>https://blog.youkuaiyun.com/VicJiao/article/details/79509390</link><guid>https://blog.youkuaiyun.com/VicJiao/article/details/79509390</guid><author>VicJiao</author><pubDate>Sat, 10 Mar 2018 16:54:46 +0800</pubDate><description><![CDATA[如题 http://www.cnblogs.com/VisJiao]]></description><category></category></item><item><title><![CDATA[LOJ6277~6285 数列分块入门]]></title><link>https://blog.youkuaiyun.com/VicJiao/article/details/79398308</link><guid>https://blog.youkuaiyun.com/VicJiao/article/details/79398308</guid><author>VicJiao</author><pubDate>Wed, 28 Feb 2018 11:28:33 +0800</pubDate><description><![CDATA[Portals



分块需注意的问题


数组大小应为N+N−−√N+NN+\sqrt N，因为最后一个块可能会超出NNN的范围。改成记录blk,fr,toblk,fr,toblk,fr,to就不用担心这个了
当操作的区间在一个块内时，要特判成暴力修改。
要清楚什么时候应该+tag[t]
最后一个块是越界的，注意是否有影响




数列分块入门 1

给出一个长为nnn的数列，以及nnn个操作，...]]></description><category></category></item><item><title><![CDATA[洛谷P3375 - 【模板】KMP字符串匹配]]></title><link>https://blog.youkuaiyun.com/VicJiao/article/details/79385385</link><guid>https://blog.youkuaiyun.com/VicJiao/article/details/79385385</guid><author>VicJiao</author><pubDate>Tue, 27 Feb 2018 11:04:26 +0800</pubDate><description><![CDATA[KMP模板]]></description><category></category></item><item><title><![CDATA[洛谷P3796 - 【模板】AC自动机（加强版）]]></title><link>https://blog.youkuaiyun.com/VicJiao/article/details/79385301</link><guid>https://blog.youkuaiyun.com/VicJiao/article/details/79385301</guid><author>VicJiao</author><pubDate>Tue, 27 Feb 2018 10:59:39 +0800</pubDate><description><![CDATA[AC自动机模板]]></description><category></category></item><item><title><![CDATA[BZOJ1150 - [CTSC2007]数据备份Backup]]></title><link>https://blog.youkuaiyun.com/VicJiao/article/details/79385162</link><guid>https://blog.youkuaiyun.com/VicJiao/article/details/79385162</guid><author>VicJiao</author><pubDate>Tue, 27 Feb 2018 10:52:23 +0800</pubDate><description><![CDATA[反悔思想好神啊]]></description><category></category></item><item><title><![CDATA[傅里叶变换 - Fourier Transform]]></title><link>https://blog.youkuaiyun.com/VicJiao/article/details/79273152</link><guid>https://blog.youkuaiyun.com/VicJiao/article/details/79273152</guid><author>VicJiao</author><pubDate>Wed, 07 Feb 2018 21:52:22 +0800</pubDate><description><![CDATA[各类傅里叶变换的个人理解]]></description><category></category></item><item><title><![CDATA[HDU5992 - Finding Hotels]]></title><link>https://blog.youkuaiyun.com/VicJiao/article/details/79222584</link><guid>https://blog.youkuaiyun.com/VicJiao/article/details/79222584</guid><author>VicJiao</author><pubDate>Wed, 31 Jan 2018 22:01:24 +0800</pubDate><description><![CDATA[简单的k-d树问题]]></description><category></category></item><item><title><![CDATA[WC2016自测]]></title><link>https://blog.youkuaiyun.com/VicJiao/article/details/79180313</link><guid>https://blog.youkuaiyun.com/VicJiao/article/details/79180313</guid><author>VicJiao</author><pubDate>Sat, 27 Jan 2018 14:36:37 +0800</pubDate><description><![CDATA[凉凉]]></description><category></category></item><item><title><![CDATA[BZOJ1009 - [HNOI2008]GT考试]]></title><link>https://blog.youkuaiyun.com/VicJiao/article/details/79175074</link><guid>https://blog.youkuaiyun.com/VicJiao/article/details/79175074</guid><author>VicJiao</author><pubDate>Fri, 26 Jan 2018 17:37:20 +0800</pubDate><description><![CDATA[我一开始以为是数学...其实是DP]]></description><category></category></item><item><title><![CDATA[BZOJ1468 - Tree]]></title><link>https://blog.youkuaiyun.com/VicJiao/article/details/79101966</link><guid>https://blog.youkuaiyun.com/VicJiao/article/details/79101966</guid><author>VicJiao</author><pubDate>Thu, 18 Jan 2018 23:49:20 +0800</pubDate><description><![CDATA[点分治第一题]]></description><category></category></item><item><title><![CDATA[POJ1740 - A New Stone Game]]></title><link>https://blog.youkuaiyun.com/VicJiao/article/details/79075329</link><guid>https://blog.youkuaiyun.com/VicJiao/article/details/79075329</guid><author>VicJiao</author><pubDate>Tue, 16 Jan 2018 15:21:44 +0800</pubDate><description><![CDATA[挺妙啊]]></description><category></category></item><item><title><![CDATA[BZOJ3053 - The Closest M Points]]></title><link>https://blog.youkuaiyun.com/VicJiao/article/details/79063531</link><guid>https://blog.youkuaiyun.com/VicJiao/article/details/79063531</guid><author>VicJiao</author><pubDate>Mon, 15 Jan 2018 13:38:31 +0800</pubDate><description><![CDATA[k维m近点]]></description><category></category></item><item><title><![CDATA[BZOJ2820 - 巧克力王国]]></title><link>https://blog.youkuaiyun.com/VicJiao/article/details/79055654</link><guid>https://blog.youkuaiyun.com/VicJiao/article/details/79055654</guid><author>VicJiao</author><pubDate>Sun, 14 Jan 2018 11:40:17 +0800</pubDate><description><![CDATA[k-d树求半平面和]]></description><category></category></item><item><title><![CDATA[BZOJ4066 - 简单题]]></title><link>https://blog.youkuaiyun.com/VicJiao/article/details/79048901</link><guid>https://blog.youkuaiyun.com/VicJiao/article/details/79048901</guid><author>VicJiao</author><pubDate>Fri, 12 Jan 2018 23:31:56 +0800</pubDate><description><![CDATA[k-d树上求和]]></description><category></category></item><item><title><![CDATA[POJ1703 - Find them, Catch them]]></title><link>https://blog.youkuaiyun.com/VicJiao/article/details/79040540</link><guid>https://blog.youkuaiyun.com/VicJiao/article/details/79040540</guid><author>VicJiao</author><pubDate>Fri, 12 Jan 2018 09:40:25 +0800</pubDate><description><![CDATA[帮派打架就是并查集啦]]></description><category></category></item><item><title><![CDATA[BZOJ1941 - [SDOI2010]Hide and Seek]]></title><link>https://blog.youkuaiyun.com/VicJiao/article/details/79038210</link><guid>https://blog.youkuaiyun.com/VicJiao/article/details/79038210</guid><author>VicJiao</author><pubDate>Thu, 11 Jan 2018 20:27:10 +0800</pubDate><description><![CDATA[k-d树稍加变化即可]]></description><category></category></item><item><title><![CDATA[BZOJ2456 - mode]]></title><link>https://blog.youkuaiyun.com/VicJiao/article/details/79035973</link><guid>https://blog.youkuaiyun.com/VicJiao/article/details/79035973</guid><author>VicJiao</author><pubDate>Thu, 11 Jan 2018 16:45:10 +0800</pubDate><description><![CDATA[妙，妙啊]]></description><category></category></item><item><title><![CDATA[BZOJ2648 - SJY摆棋子]]></title><link>https://blog.youkuaiyun.com/VicJiao/article/details/79033901</link><guid>https://blog.youkuaiyun.com/VicJiao/article/details/79033901</guid><author>VicJiao</author><pubDate>Thu, 11 Jan 2018 14:33:37 +0800</pubDate><description><![CDATA[k-d树裸题]]></description><category></category></item><item><title><![CDATA[POJ1639 - Picnic Planning]]></title><link>https://blog.youkuaiyun.com/VicJiao/article/details/79026378</link><guid>https://blog.youkuaiyun.com/VicJiao/article/details/79026378</guid><author>VicJiao</author><pubDate>Wed, 10 Jan 2018 17:27:49 +0800</pubDate><description><![CDATA[最小度限制生成树]]></description><category></category></item><item><title><![CDATA[LOJ6003 - 「网络流 24 题」魔术球]]></title><link>https://blog.youkuaiyun.com/VicJiao/article/details/79016227</link><guid>https://blog.youkuaiyun.com/VicJiao/article/details/79016227</guid><author>VicJiao</author><pubDate>Tue, 09 Jan 2018 18:54:06 +0800</pubDate><description><![CDATA[二分答案 + 最小路径覆盖]]></description><category></category></item></channel></rss>