<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[ZYL的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/zzyyyl</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; zzyyyl]]></copyright><item><title><![CDATA[哔哩哔哩稿件号转换]]></title><link>https://blog.youkuaiyun.com/zzyyyl/article/details/105093385</link><guid>https://blog.youkuaiyun.com/zzyyyl/article/details/105093385</guid><author>zzyyyl</author><pubDate>Wed, 25 Mar 2020 13:49:03 +0800</pubDate><description><![CDATA[关于哔哩哔哩稿件号转换。
我提供的是C++代码来转换av号与BV号。
算法来自知乎大佬，代码中并没有关于算法的注释，但我想看完算法之后应该在理解代码上不会有太大问题。]]></description><category></category></item><item><title><![CDATA[CF569D Symmetric and Transitive（组合数+集合分划数）]]></title><link>https://blog.youkuaiyun.com/zzyyyl/article/details/82750093</link><guid>https://blog.youkuaiyun.com/zzyyyl/article/details/82750093</guid><author>zzyyyl</author><pubDate>Mon, 17 Sep 2018 22:26:04 +0800</pubDate><description><![CDATA[文章目录**Symmetric and Transitive****Input****Output****Sample Input****Sample Output****题意****分析****CODE**
Symmetric and Transitive
传送门1传送门2
Little Johnny has recently learned about set theory. Now he i...]]></description><category></category></item><item><title><![CDATA[ZOJ3349 Special Subsequence（dp+线段树）]]></title><link>https://blog.youkuaiyun.com/zzyyyl/article/details/82712127</link><guid>https://blog.youkuaiyun.com/zzyyyl/article/details/82712127</guid><author>zzyyyl</author><pubDate>Sat, 15 Sep 2018 11:15:36 +0800</pubDate><description><![CDATA[Special Subsequence

传送门1传送门2 
There a sequence SSS with nnn integers , and AAA is a special subsequence that satisfies |Ai−Ai−1|&amp;lt;=d(0&amp;lt;i&amp;lt;=|A|))|Ai−Ai−1|&amp;lt;=d(0&amp;lt;i&amp;lt;=|A|))|A_i\!-\!A_{i-1}...]]></description><category></category></item><item><title><![CDATA[HDU3308 LCIS（线段树区间合并）]]></title><link>https://blog.youkuaiyun.com/zzyyyl/article/details/82693424</link><guid>https://blog.youkuaiyun.com/zzyyyl/article/details/82693424</guid><author>zzyyyl</author><pubDate>Thu, 13 Sep 2018 19:27:06 +0800</pubDate><description><![CDATA[LCIS

传送门1传送门2 
Given n integers.  
You have two operations:  
U A B: replace the Ath number by B. (index counting from 0)  
Q A B: output the length of the longest consecutive increasing subsequence ...]]></description><category></category></item><item><title><![CDATA[HDU2665 Kth number（归并树模板）]]></title><link>https://blog.youkuaiyun.com/zzyyyl/article/details/82659745</link><guid>https://blog.youkuaiyun.com/zzyyyl/article/details/82659745</guid><author>zzyyyl</author><pubDate>Wed, 12 Sep 2018 12:44:20 +0800</pubDate><description><![CDATA[Kth number 

传送门1传送门2 
Give you a sequence and ask you the kth big number of a inteval.



Input

The first line is the number of the test cases.  
For each test case, the first line contain two integ...]]></description><category></category></item><item><title><![CDATA[2017-11-9离线赛总结]]></title><link>https://blog.youkuaiyun.com/zzyyyl/article/details/78491873</link><guid>https://blog.youkuaiyun.com/zzyyyl/article/details/78491873</guid><author>zzyyyl</author><pubDate>Thu, 09 Nov 2017 17:15:51 +0800</pubDate><description><![CDATA[2017-11-9离线赛总结]]></description><category></category></item><item><title><![CDATA[2017-11-8离线赛总结]]></title><link>https://blog.youkuaiyun.com/zzyyyl/article/details/78479708</link><guid>https://blog.youkuaiyun.com/zzyyyl/article/details/78479708</guid><author>zzyyyl</author><pubDate>Wed, 08 Nov 2017 15:50:50 +0800</pubDate><description><![CDATA[2017-11-8离线赛总结]]></description><category></category></item><item><title><![CDATA[HDU5000 Clone（计数dp）]]></title><link>https://blog.youkuaiyun.com/zzyyyl/article/details/78471939</link><guid>https://blog.youkuaiyun.com/zzyyyl/article/details/78471939</guid><author>zzyyyl</author><pubDate>Tue, 07 Nov 2017 20:16:53 +0800</pubDate><description><![CDATA[Clone]]></description><category></category></item><item><title><![CDATA[2017-11-7离线赛总结]]></title><link>https://blog.youkuaiyun.com/zzyyyl/article/details/78469313</link><guid>https://blog.youkuaiyun.com/zzyyyl/article/details/78469313</guid><author>zzyyyl</author><pubDate>Tue, 07 Nov 2017 16:29:50 +0800</pubDate><description><![CDATA[2017-11-7离线赛总结]]></description><category></category></item><item><title><![CDATA[2017-11-6离线赛总结]]></title><link>https://blog.youkuaiyun.com/zzyyyl/article/details/78458231</link><guid>https://blog.youkuaiyun.com/zzyyyl/article/details/78458231</guid><author>zzyyyl</author><pubDate>Mon, 06 Nov 2017 15:34:32 +0800</pubDate><description><![CDATA[2017-11-6离线赛总结]]></description><category></category></item><item><title><![CDATA[2017-11-5离线赛总结]]></title><link>https://blog.youkuaiyun.com/zzyyyl/article/details/78451898</link><guid>https://blog.youkuaiyun.com/zzyyyl/article/details/78451898</guid><author>zzyyyl</author><pubDate>Sun, 05 Nov 2017 20:17:02 +0800</pubDate><description><![CDATA[2017-11-5离线赛总结]]></description><category></category></item><item><title><![CDATA[POJ2115 C Looooops（扩展欧几里得）]]></title><link>https://blog.youkuaiyun.com/zzyyyl/article/details/78446357</link><guid>https://blog.youkuaiyun.com/zzyyyl/article/details/78446357</guid><author>zzyyyl</author><pubDate>Sat, 04 Nov 2017 21:53:53 +0800</pubDate><description><![CDATA[C Looooops]]></description><category></category></item><item><title><![CDATA[YCJSOI1472 质数取石子（博弈dp）]]></title><link>https://blog.youkuaiyun.com/zzyyyl/article/details/78444578</link><guid>https://blog.youkuaiyun.com/zzyyyl/article/details/78444578</guid><author>zzyyyl</author><pubDate>Sat, 04 Nov 2017 17:02:24 +0800</pubDate><description><![CDATA[YCJSOI1472]]></description><category></category></item><item><title><![CDATA[YCJSOI1471 石头剪刀布（博弈dp）]]></title><link>https://blog.youkuaiyun.com/zzyyyl/article/details/78444556</link><guid>https://blog.youkuaiyun.com/zzyyyl/article/details/78444556</guid><author>zzyyyl</author><pubDate>Sat, 04 Nov 2017 16:59:44 +0800</pubDate><description><![CDATA[YCJSOI1471]]></description><category></category></item><item><title><![CDATA[2017-11-4离线赛总结]]></title><link>https://blog.youkuaiyun.com/zzyyyl/article/details/78444040</link><guid>https://blog.youkuaiyun.com/zzyyyl/article/details/78444040</guid><author>zzyyyl</author><pubDate>Sat, 04 Nov 2017 15:56:59 +0800</pubDate><description><![CDATA[2017-11-4离线赛总结]]></description><category></category></item><item><title><![CDATA[2017-11-3离线赛总结]]></title><link>https://blog.youkuaiyun.com/zzyyyl/article/details/78436448</link><guid>https://blog.youkuaiyun.com/zzyyyl/article/details/78436448</guid><author>zzyyyl</author><pubDate>Fri, 03 Nov 2017 15:48:37 +0800</pubDate><description><![CDATA[2017-11-3离线赛总结]]></description><category></category></item><item><title><![CDATA[HDU5452 Minimum Cut（图论）]]></title><link>https://blog.youkuaiyun.com/zzyyyl/article/details/78428013</link><guid>https://blog.youkuaiyun.com/zzyyyl/article/details/78428013</guid><author>zzyyyl</author><pubDate>Thu, 02 Nov 2017 18:37:48 +0800</pubDate><description><![CDATA[Minimum Cut]]></description><category></category></item><item><title><![CDATA[HDU5044 Tree（树链剖分）]]></title><link>https://blog.youkuaiyun.com/zzyyyl/article/details/78426338</link><guid>https://blog.youkuaiyun.com/zzyyyl/article/details/78426338</guid><author>zzyyyl</author><pubDate>Thu, 02 Nov 2017 16:27:55 +0800</pubDate><description><![CDATA[Tree]]></description><category></category></item><item><title><![CDATA[HDU3966 Aragorn's Story（树链剖分+线段树）]]></title><link>https://blog.youkuaiyun.com/zzyyyl/article/details/78422391</link><guid>https://blog.youkuaiyun.com/zzyyyl/article/details/78422391</guid><author>zzyyyl</author><pubDate>Thu, 02 Nov 2017 10:48:21 +0800</pubDate><description><![CDATA[Aragorn’s Story]]></description><category></category></item><item><title><![CDATA[HDU2586 How far away?（树链剖分求LCA）]]></title><link>https://blog.youkuaiyun.com/zzyyyl/article/details/78421250</link><guid>https://blog.youkuaiyun.com/zzyyyl/article/details/78421250</guid><author>zzyyyl</author><pubDate>Thu, 02 Nov 2017 09:36:41 +0800</pubDate><description><![CDATA[How far away?]]></description><category></category></item></channel></rss>