<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[zaqjkl的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/zaqjkl</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; zaqjkl]]></copyright><item><title><![CDATA[股票买卖 V]]></title><link>https://blog.youkuaiyun.com/zaqjkl/article/details/141386230</link><guid>https://blog.youkuaiyun.com/zaqjkl/article/details/141386230</guid><author>zaqjkl</author><pubDate>Wed, 21 Aug 2024 10:11:32 +0800</pubDate><description><![CDATA[【代码】股票买卖 V。]]></description><category></category></item><item><title><![CDATA[股票买卖 IV]]></title><link>https://blog.youkuaiyun.com/zaqjkl/article/details/141385369</link><guid>https://blog.youkuaiyun.com/zaqjkl/article/details/141385369</guid><author>zaqjkl</author><pubDate>Wed, 21 Aug 2024 10:03:55 +0800</pubDate><description><![CDATA[【代码】股票买卖 IV。]]></description><category></category></item><item><title><![CDATA[金明的预算方案]]></title><link>https://blog.youkuaiyun.com/zaqjkl/article/details/141363900</link><guid>https://blog.youkuaiyun.com/zaqjkl/article/details/141363900</guid><author>zaqjkl</author><pubDate>Tue, 20 Aug 2024 17:25:49 +0800</pubDate><description><![CDATA[【代码】金明的预算方案。]]></description><category></category></item><item><title><![CDATA[能量石]]></title><link>https://blog.youkuaiyun.com/zaqjkl/article/details/141363674</link><guid>https://blog.youkuaiyun.com/zaqjkl/article/details/141363674</guid><author>zaqjkl</author><pubDate>Tue, 20 Aug 2024 17:18:37 +0800</pubDate><description><![CDATA[【代码】能量石。]]></description><category></category></item><item><title><![CDATA[背包问题求方案数]]></title><link>https://blog.youkuaiyun.com/zaqjkl/article/details/141362993</link><guid>https://blog.youkuaiyun.com/zaqjkl/article/details/141362993</guid><author>zaqjkl</author><pubDate>Tue, 20 Aug 2024 16:59:06 +0800</pubDate><description><![CDATA[【代码】背包问题求方案数。]]></description><category></category></item><item><title><![CDATA[大盗阿福 状态机版本]]></title><link>https://blog.youkuaiyun.com/zaqjkl/article/details/141338966</link><guid>https://blog.youkuaiyun.com/zaqjkl/article/details/141338966</guid><author>zaqjkl</author><pubDate>Tue, 20 Aug 2024 03:03:32 +0800</pubDate><description><![CDATA[【代码】大盗阿福 状态机版本。]]></description><category></category></item><item><title><![CDATA[有依赖的背包问题]]></title><link>https://blog.youkuaiyun.com/zaqjkl/article/details/141306144</link><guid>https://blog.youkuaiyun.com/zaqjkl/article/details/141306144</guid><author>zaqjkl</author><pubDate>Sun, 18 Aug 2024 21:48:55 +0800</pubDate><description><![CDATA[【代码】有依赖的背包问题。]]></description><category></category></item><item><title><![CDATA[滑雪 记忆化搜索]]></title><link>https://blog.youkuaiyun.com/zaqjkl/article/details/141283077</link><guid>https://blog.youkuaiyun.com/zaqjkl/article/details/141283077</guid><author>zaqjkl</author><pubDate>Sat, 17 Aug 2024 16:47:48 +0800</pubDate><description><![CDATA[【代码】滑雪 记忆化搜索。]]></description><category></category></item><item><title><![CDATA[最短Hamilton路径 状压DP]]></title><link>https://blog.youkuaiyun.com/zaqjkl/article/details/141282475</link><guid>https://blog.youkuaiyun.com/zaqjkl/article/details/141282475</guid><author>zaqjkl</author><pubDate>Sat, 17 Aug 2024 16:17:08 +0800</pubDate><description><![CDATA[【代码】最短Hamilton路径 状压DP。]]></description><category></category></item><item><title><![CDATA[没有上司的舞会 树形DP]]></title><link>https://blog.youkuaiyun.com/zaqjkl/article/details/141280564</link><guid>https://blog.youkuaiyun.com/zaqjkl/article/details/141280564</guid><author>zaqjkl</author><pubDate>Sat, 17 Aug 2024 14:54:37 +0800</pubDate><description><![CDATA[【代码】没有上司的舞会 树形DP。]]></description><category></category></item><item><title><![CDATA[区间最大公约数 用线段树实现：区间加+区间公共gcd查询·]]></title><link>https://blog.youkuaiyun.com/zaqjkl/article/details/141098538</link><guid>https://blog.youkuaiyun.com/zaqjkl/article/details/141098538</guid><author>zaqjkl</author><pubDate>Sun, 11 Aug 2024 00:01:12 +0800</pubDate><description><![CDATA[【代码】区间最大公约数 用线段树实现：区间加+区间公共gcd查询·]]></description><category></category></item><item><title><![CDATA[你能回答这些问题吗 区间最大连续子段和查询 线段树]]></title><link>https://blog.youkuaiyun.com/zaqjkl/article/details/141092048</link><guid>https://blog.youkuaiyun.com/zaqjkl/article/details/141092048</guid><author>zaqjkl</author><pubDate>Sat, 10 Aug 2024 15:53:14 +0800</pubDate><description><![CDATA[【代码】你能回答这些问题吗 区间最大连续子段和查询 线段树。]]></description><category></category></item><item><title><![CDATA[最大数 线段树实现区间最大值查询]]></title><link>https://blog.youkuaiyun.com/zaqjkl/article/details/141085761</link><guid>https://blog.youkuaiyun.com/zaqjkl/article/details/141085761</guid><author>zaqjkl</author><pubDate>Sat, 10 Aug 2024 09:03:15 +0800</pubDate><description><![CDATA[【代码】最大数 线段树实现区间最大值查询。]]></description><category></category></item><item><title><![CDATA[堆排序 线性建堆]]></title><link>https://blog.youkuaiyun.com/zaqjkl/article/details/141019388</link><guid>https://blog.youkuaiyun.com/zaqjkl/article/details/141019388</guid><author>zaqjkl</author><pubDate>Thu, 08 Aug 2024 10:10:01 +0800</pubDate><description><![CDATA[【代码】堆排序]]></description><category></category></item><item><title><![CDATA[谜一样的牛 查找剩下的数中第k+1大的数 树状数组二分]]></title><link>https://blog.youkuaiyun.com/zaqjkl/article/details/141004413</link><guid>https://blog.youkuaiyun.com/zaqjkl/article/details/141004413</guid><author>zaqjkl</author><pubDate>Thu, 08 Aug 2024 01:17:17 +0800</pubDate><description><![CDATA[首先给每一个位置上初始化一个1（表示剩下的数，0代表被选择的数）这样每一位的前缀和的含义就该数是剩下的数中的第几位。用树状数组的单点修改来维护每个位置的状态，用树状数组的前缀和来维护该位置是剩下的数的几大的数字。]]></description><category></category></item><item><title><![CDATA[一个简单的整数问题2 区间加 + 区间和 树状数组动态维护前缀和]]></title><link>https://blog.youkuaiyun.com/zaqjkl/article/details/141004026</link><guid>https://blog.youkuaiyun.com/zaqjkl/article/details/141004026</guid><author>zaqjkl</author><pubDate>Thu, 08 Aug 2024 00:03:33 +0800</pubDate><description><![CDATA[这样前缀和就别转换为了两个差分前缀和的形式，只需要将差分数组用数组数组处理即可。树状数组只是处理数据的一种形式可以使操作对象具有树状数组的性质。再通过一般前缀和求区间和的思想求出某一段之和。1.处理出原数组的差分数组，即可实现区间加；]]></description><category></category></item><item><title><![CDATA[一个简单的整数问题 差分数组 * 树状数组 实现区间修改和单点查询]]></title><link>https://blog.youkuaiyun.com/zaqjkl/article/details/140970178</link><guid>https://blog.youkuaiyun.com/zaqjkl/article/details/140970178</guid><author>zaqjkl</author><pubDate>Wed, 07 Aug 2024 03:02:04 +0800</pubDate><description><![CDATA[将原数组变为差分数组再在差分数组上创建树状数组，区间修使用差分数组的修改方式可以通过树状数组的单点修改实现，单点查询使用树状数组的求前缀和实现。]]></description><category></category></item><item><title><![CDATA[管道 蓝桥杯 二分答案 + 变种区间合并 + 很多细节]]></title><link>https://blog.youkuaiyun.com/zaqjkl/article/details/140749769</link><guid>https://blog.youkuaiyun.com/zaqjkl/article/details/140749769</guid><author>zaqjkl</author><pubDate>Sun, 28 Jul 2024 13:41:56 +0800</pubDate><description><![CDATA[1.二分时mid的大小最大会来到 2 * r 的大小，当r很大计算时将 r 和 l 转化为long long 计算。1.从某一时刻之后整个管道都会被填满而之前就不会，发现答案具有二段性使用二分。2.判断已有水区间是否合并为一个且包含起始端点。]]></description><category></category></item><item><title><![CDATA[分巧克力 二分]]></title><link>https://blog.youkuaiyun.com/zaqjkl/article/details/140748885</link><guid>https://blog.youkuaiyun.com/zaqjkl/article/details/140748885</guid><author>zaqjkl</author><pubDate>Sun, 28 Jul 2024 12:04:57 +0800</pubDate><description><![CDATA[思考可以发现当边长大于某一个值以后切出的巧克力数量都不满足，所以可以使用二分。]]></description><category></category></item><item><title><![CDATA[借教室 二分答案 + 差分]]></title><link>https://blog.youkuaiyun.com/zaqjkl/article/details/140748573</link><guid>https://blog.youkuaiyun.com/zaqjkl/article/details/140748573</guid><author>zaqjkl</author><pubDate>Sun, 28 Jul 2024 11:43:35 +0800</pubDate><description><![CDATA[1.当出现第一个不满足的订单后，后面的订单都是不满足的，所以可以通过二分答案找到第一个不满足的订单，因为每次都是从前往后借教室所以要把每次的操作存储一下。2.每次借用教室的时候对应区间的教室数量会减少是区间修改可以使用差分。]]></description><category></category></item></channel></rss>