<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[huyuncong的专栏]]></title><description><![CDATA[我将永远困惑,也永远寻找,困惑是我的诚实,寻找是我的勇敢。]]></description><link>https://blog.youkuaiyun.com/huyuncong</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; huyuncong]]></copyright><item><title><![CDATA[zkw线段树修正 标记上升]]></title><link>https://blog.youkuaiyun.com/huyuncong/article/details/6844385</link><guid>https://blog.youkuaiyun.com/huyuncong/article/details/6844385</guid><author>huyuncong</author><pubDate>Sat, 12 Oct 2019 13:22:37 +0800</pubDate><description><![CDATA[恢复一下被吞的blog。。

今天才发现统计的力量很坑爹，同时发现了我写线段树的漏洞。

首先说我自己的问题，线段树最后一层的第一个节点不能用，但我以前用了而且一直没出问题，这次涉及区间修改才出现问题。

然后是统计的力量，里面关于区间修改，区间查询最大值的代码有bug，不但修改上传标记与查询回收标记一个是求最小值的，一个是最大值的，而且标记上传也不完全，查询时不能改开区间等等问题，幸亏有奥特曼的...]]></description><category></category></item><item><title><![CDATA[重新捡起博客，督促自己看paper]]></title><link>https://blog.youkuaiyun.com/huyuncong/article/details/102518677</link><guid>https://blog.youkuaiyun.com/huyuncong/article/details/102518677</guid><author>huyuncong</author><pubDate>Sat, 12 Oct 2019 13:21:59 +0800</pubDate><description><![CDATA[RT

竞赛类文章不会发啦，希望能摆脱划水状态。。。
]]></description><category></category></item><item><title><![CDATA[【回文自动机】ural2040]]></title><link>https://blog.youkuaiyun.com/huyuncong/article/details/41181953</link><guid>https://blog.youkuaiyun.com/huyuncong/article/details/41181953</guid><author>huyuncong</author><pubDate>Sun, 16 Nov 2014 23:17:26 +0800</pubDate><description><![CDATA[题意：依次添加字符询问增加的]]></description><category></category></item><item><title><![CDATA[【快速数论变换NTT】AVL tree]]></title><link>https://blog.youkuaiyun.com/huyuncong/article/details/40746345</link><guid>https://blog.youkuaiyun.com/huyuncong/article/details/40746345</guid><author>huyuncong</author><pubDate>Mon, 03 Nov 2014 20:07:34 +0800</pubDate><description><![CDATA[询问有n个节点，h高度的AVL有多少种。
可以定义f[i][j]为gao w]]></description><category></category></item><item><title><![CDATA[【可持久化平衡树】Version Controlled IDE]]></title><link>https://blog.youkuaiyun.com/huyuncong/article/details/40662079</link><guid>https://blog.youkuaiyun.com/huyuncong/article/details/40662079</guid><author>huyuncong</author><pubDate>Fri, 31 Oct 2014 22:09:14 +0800</pubDate><description><![CDATA[首先是直接用拓展stl的实现，各种操作]]></description><category></category></item><item><title><![CDATA[【除草】Hackerrank思考题]]></title><link>https://blog.youkuaiyun.com/huyuncong/article/details/40632431</link><guid>https://blog.youkuaiyun.com/huyuncong/article/details/40632431</guid><author>huyuncong</author><pubDate>Thu, 30 Oct 2014 23:54:07 +0800</pubDate><description><![CDATA[matrix tree
矩阵aij,表示i和j的lca的点权值]]></description><category></category></item><item><title><![CDATA[【最佳平方逼近】hdu4851]]></title><link>https://blog.youkuaiyun.com/huyuncong/article/details/40397929</link><guid>https://blog.youkuaiyun.com/huyuncong/article/details/40397929</guid><author>huyuncong</author><pubDate>Thu, 23 Oct 2014 15:16:30 +0800</pubDate><description><![CDATA[找出不超过n次]]></description><category></category></item><item><title><![CDATA[【点分治】hdu4918]]></title><link>https://blog.youkuaiyun.com/huyuncong/article/details/39400389</link><guid>https://blog.youkuaiyun.com/huyuncong/article/details/39400389</guid><author>huyuncong</author><pubDate>Fri, 19 Sep 2014 16:57:20 +0800</pubDate><description><![CDATA[用类似qtree4的思想，在点分治的每一层都]]></description><category></category></item><item><title><![CDATA[【动态树X脑残错误】hdu5002]]></title><link>https://blog.youkuaiyun.com/huyuncong/article/details/39268007</link><guid>https://blog.youkuaiyun.com/huyuncong/article/details/39268007</guid><author>huyuncong</author><pubDate>Sun, 14 Sep 2014 10:16:09 +0800</pubDate><description><![CDATA[本来一个挺简单的一个动态树，结果]]></description><category></category></item><item><title><![CDATA[【FFT加速特征多项式解线性递推】hdu4914]]></title><link>https://blog.youkuaiyun.com/huyuncong/article/details/39267793</link><guid>https://blog.youkuaiyun.com/huyuncong/article/details/39267793</guid><author>huyuncong</author><pubDate>Sun, 14 Sep 2014 09:56:10 +0800</pubDate><description><![CDATA[上一篇：http://blog.youkuaiyun.com/huyuncong/article/details/18184873]]></description><category></category></item><item><title><![CDATA[【二分图匹配判定+线段树建边】pku1057]]></title><link>https://blog.youkuaiyun.com/huyuncong/article/details/38590413</link><guid>https://blog.youkuaiyun.com/huyuncong/article/details/38590413</guid><author>huyuncong</author><pubDate>Fri, 15 Aug 2014 21:16:21 +0800</pubDate><description><![CDATA[首先行列是可以分开考虑的，相两个排列]]></description><category></category></item><item><title><![CDATA[【动态树】hdu4897]]></title><link>https://blog.youkuaiyun.com/huyuncong/article/details/38558665</link><guid>https://blog.youkuaiyun.com/huyuncong/article/details/38558665</guid><author>huyuncong</author><pubDate>Thu, 14 Aug 2014 15:09:14 +0800</pubDate><description><![CDATA[两种操作，第一种一条路径的边的颜色取反，第二种将yi ba]]></description><category></category></item><item><title><![CDATA[【bsgs】hdu4887]]></title><link>https://blog.youkuaiyun.com/huyuncong/article/details/38448627</link><guid>https://blog.youkuaiyun.com/huyuncong/article/details/38448627</guid><author>huyuncong</author><pubDate>Fri, 08 Aug 2014 23:50:11 +0800</pubDate><description><![CDATA[可以看出这些操作是可以用]]></description><category></category></item><item><title><![CDATA[【ural1764】单纯形]]></title><link>https://blog.youkuaiyun.com/huyuncong/article/details/38425283</link><guid>https://blog.youkuaiyun.com/huyuncong/article/details/38425283</guid><author>huyuncong</author><pubDate>Thu, 07 Aug 2014 21:16:44 +0800</pubDate><description><![CDATA[整理模板...
n个变量，m个约束条件，系数矩阵最后一行]]></description><category></category></item><item><title><![CDATA[【FFT】大整数乘法]]></title><link>https://blog.youkuaiyun.com/huyuncong/article/details/38149535</link><guid>https://blog.youkuaiyun.com/huyuncong/article/details/38149535</guid><author>huyuncong</author><pubDate>Sat, 26 Jul 2014 20:13:07 +0800</pubDate><description><![CDATA[http://www.cnblogs.com/skyivben/archive/2008/07/23/1248413.html
整理一下模板
hdu1402
sincos需要手写，因为hdu没有.]]></description><category></category></item><item><title><![CDATA[【hdu3238】Finding the Most Vital Node of a Shortest Path]]></title><link>https://blog.youkuaiyun.com/huyuncong/article/details/37935755</link><guid>https://blog.youkuaiyun.com/huyuncong/article/details/37935755</guid><author>huyuncong</author><pubDate>Fri, 18 Jul 2014 20:42:36 +0800</pubDate><description><![CDATA[题意：给定s,t,求出无向图上，去掉第i个点z]]></description><category></category></item><item><title><![CDATA[【2-sat】uva1391]]></title><link>https://blog.youkuaiyun.com/huyuncong/article/details/37889283</link><guid>https://blog.youkuaiyun.com/huyuncong/article/details/37889283</guid><author>huyuncong</author><pubDate>Wed, 16 Jul 2014 23:12:32 +0800</pubDate><description><![CDATA[输出方案采用了刘大师的写法，直接给每个强连通分量标号，每个点只要选较小]]></description><category></category></item><item><title><![CDATA[【除草】一些稍难题]]></title><link>https://blog.youkuaiyun.com/huyuncong/article/details/37738649</link><guid>https://blog.youkuaiyun.com/huyuncong/article/details/37738649</guid><author>huyuncong</author><pubDate>Sun, 13 Jul 2014 14:16:11 +0800</pubDate><description><![CDATA[hdu4623
通过打表发现很多数字在考虑互质的情况是dengjia]]></description><category></category></item><item><title><![CDATA[【除草】一些题目]]></title><link>https://blog.youkuaiyun.com/huyuncong/article/details/37565293</link><guid>https://blog.youkuaiyun.com/huyuncong/article/details/37565293</guid><author>huyuncong</author><pubDate>Tue, 08 Jul 2014 15:23:22 +0800</pubDate><description><![CDATA[hdu4304
一段n*n的墙，用一个刷子来刷，要求刷子的第一根毛在第一个]]></description><category></category></item><item><title><![CDATA[【圆的反演变换+cdq分治】共点圆]]></title><link>https://blog.youkuaiyun.com/huyuncong/article/details/36895153</link><guid>https://blog.youkuaiyun.com/huyuncong/article/details/36895153</guid><author>huyuncong</author><pubDate>Fri, 04 Jul 2014 15:56:59 +0800</pubDate><description><![CDATA[http://www.tsinsen.com/ViewGProblem.page?gpid=A1381]]></description><category></category></item></channel></rss>