<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[INGNIGHT的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/INGNIGHT</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; INGNIGHT]]></copyright><item><title><![CDATA[248 · 统计比给定整数小的数的个数(线段树，二分，前缀)]]></title><link>https://blog.youkuaiyun.com/INGNIGHT/article/details/170366189</link><guid>https://blog.youkuaiyun.com/INGNIGHT/article/details/170366189</guid><author>INGNIGHT</author><pubDate>Mon, 09 Nov 2026 20:44:04 +0800</pubDate><description><![CDATA[【代码】248 · 统计比给定整数小的数的个数(线段树，二分，前缀)]]></description><category></category></item><item><title><![CDATA[617 · 子数组的最大平均值 II(二分法，前缀)]]></title><link>https://blog.youkuaiyun.com/INGNIGHT/article/details/170148750</link><guid>https://blog.youkuaiyun.com/INGNIGHT/article/details/170148750</guid><author>INGNIGHT</author><pubDate>Thu, 05 Nov 2026 21:14:26 +0800</pubDate><description><![CDATA[j <= i - k;++j) {   // ✅ 枚举所有合法起点。，比值反而可能不是最大。只保留一个下标，等于只优化了分子，丢掉了分母。此时“最小值”就是“最有利的起点”，不需要知道。就返回 true，对应子数组。，外层二分 100 次，总。是谁，也不需要考虑分母。（值为 0），所以你的。]]></description><category></category></item><item><title><![CDATA[558 · 滑动窗口矩阵的最大值（前缀）]]></title><link>https://blog.youkuaiyun.com/INGNIGHT/article/details/169947249</link><guid>https://blog.youkuaiyun.com/INGNIGHT/article/details/169947249</guid><author>INGNIGHT</author><pubDate>Tue, 03 Nov 2026 16:39:35 +0800</pubDate><description><![CDATA[【代码】558 · 滑动窗口矩阵的最大值（前缀）]]></description><category></category></item><item><title><![CDATA[91 · 最小调整代价(序列dp)]]></title><link>https://blog.youkuaiyun.com/INGNIGHT/article/details/169262660</link><guid>https://blog.youkuaiyun.com/INGNIGHT/article/details/169262660</guid><author>INGNIGHT</author><pubDate>Tue, 27 Oct 2026 15:52:45 +0800</pubDate><description><![CDATA[f[i]中部的下标i表示前i个元素a[0],a[1],...,a[i-1]的某种性质。坐标型的f[i]表示以ai为结尾的某种性质。初始化中,f[0]表示空序列的性质。题解：序列dp+状态。]]></description><category></category></item><item><title><![CDATA[518.零钱兑换 II (背包 无限次数)]]></title><link>https://blog.youkuaiyun.com/INGNIGHT/article/details/169251449</link><guid>https://blog.youkuaiyun.com/INGNIGHT/article/details/169251449</guid><author>INGNIGHT</author><pubDate>Tue, 27 Oct 2026 11:25:54 +0800</pubDate><description><![CDATA[【代码】518.零钱兑换 II。]]></description><category></category></item><item><title><![CDATA[396 · 硬币排成线 III（区间dp）]]></title><link>https://blog.youkuaiyun.com/INGNIGHT/article/details/169156172</link><guid>https://blog.youkuaiyun.com/INGNIGHT/article/details/169156172</guid><author>INGNIGHT</author><pubDate>Mon, 26 Oct 2026 13:09:05 +0800</pubDate><description><![CDATA[【代码】396 · 硬币排成线 III。]]></description><category></category></item><item><title><![CDATA[440 · 背包问题（三）（无限次数）]]></title><link>https://blog.youkuaiyun.com/INGNIGHT/article/details/169149407</link><guid>https://blog.youkuaiyun.com/INGNIGHT/article/details/169149407</guid><author>INGNIGHT</author><pubDate>Mon, 26 Oct 2026 11:34:14 +0800</pubDate><description><![CDATA[dp[i][j]前i个物品凑出j个大小的背包，获得的价值是多少。]]></description><category></category></item><item><title><![CDATA[377.组合总和 Ⅳ(背包)]]></title><link>https://blog.youkuaiyun.com/INGNIGHT/article/details/168978768</link><guid>https://blog.youkuaiyun.com/INGNIGHT/article/details/168978768</guid><author>INGNIGHT</author><pubDate>Sat, 24 Oct 2026 23:11:15 +0800</pubDate><description><![CDATA[【代码】377.组合总和 Ⅳ。]]></description><category></category></item><item><title><![CDATA[309.最佳买卖股票时机含冷冻期(序列dp)]]></title><link>https://blog.youkuaiyun.com/INGNIGHT/article/details/168770279</link><guid>https://blog.youkuaiyun.com/INGNIGHT/article/details/168770279</guid><author>INGNIGHT</author><pubDate>Thu, 22 Oct 2026 17:32:30 +0800</pubDate><description><![CDATA[dp[i][1] 买入状态继续保持，昨天冷冻期，今天买入，dp[i-1][1], dp[i-1][2] - prices[i-1];dp[i][0] 今天买出，昨天持有+今天卖出价格，dp[i-1] + price[i-1]dp[i][2] 昨天冷冻期继续保持，昨天已经买出，dp[i-1][2],dp[i-1][0]dp[i][j] 表示前i天，处于j状态时候获得的最大利润。]]></description><category></category></item><item><title><![CDATA[151 · 买卖股票的最佳时机 III（序列dp）]]></title><link>https://blog.youkuaiyun.com/INGNIGHT/article/details/168750424</link><guid>https://blog.youkuaiyun.com/INGNIGHT/article/details/168750424</guid><author>INGNIGHT</author><pubDate>Thu, 22 Oct 2026 10:45:01 +0800</pubDate><description><![CDATA[dp[i][j] 前i个位置，在第j个节点，获得最大利用是什么。]]></description><category></category></item><item><title><![CDATA[给定一个长度为 n 的数组，数组中的元素取值范围是 1 到 n，统计每个元素（1、2、…、n）分别出现了多少次。(hash)]]></title><link>https://blog.youkuaiyun.com/INGNIGHT/article/details/168657725</link><guid>https://blog.youkuaiyun.com/INGNIGHT/article/details/168657725</guid><author>INGNIGHT</author><pubDate>Wed, 21 Oct 2026 16:49:43 +0800</pubDate><description><![CDATA[例如：textnums = [1, 2, 2, 3, 1, 4]   // n = 6，元素在 1~6 之间统计结果：text1 出现 2 次2 出现 2 次3 出现 1 次4 出现 1 次5 出现 0 次6 出现 0 次下面给出三种解法。]]></description><category></category></item><item><title><![CDATA[815 · 课程表IV（dfs）]]></title><link>https://blog.youkuaiyun.com/INGNIGHT/article/details/168453335</link><guid>https://blog.youkuaiyun.com/INGNIGHT/article/details/168453335</guid><author>INGNIGHT</author><pubDate>Mon, 19 Oct 2026 20:53:49 +0800</pubDate><description><![CDATA[【代码】815 · 课程表IV（dfs）]]></description><category></category></item><item><title><![CDATA[486. 预测赢家（博弈dp/区间dp）]]></title><link>https://blog.youkuaiyun.com/INGNIGHT/article/details/167791703</link><guid>https://blog.youkuaiyun.com/INGNIGHT/article/details/167791703</guid><author>INGNIGHT</author><pubDate>Tue, 13 Oct 2026 11:10:35 +0800</pubDate><description><![CDATA[【代码】486. 预测赢家（博弈dp/区间dp）]]></description><category></category></item><item><title><![CDATA[593 · 石头游戏 II （区间dp石子合并 翻倍循环问题）]]></title><link>https://blog.youkuaiyun.com/INGNIGHT/article/details/167699815</link><guid>https://blog.youkuaiyun.com/INGNIGHT/article/details/167699815</guid><author>INGNIGHT</author><pubDate>Mon, 12 Oct 2026 17:25:56 +0800</pubDate><description><![CDATA[【代码】593 · 石头游戏 II （区间dp石子合并）]]></description><category></category></item><item><title><![CDATA[1861 · 老鼠跳跃（坐标型dp)]]></title><link>https://blog.youkuaiyun.com/INGNIGHT/article/details/167497098</link><guid>https://blog.youkuaiyun.com/INGNIGHT/article/details/167497098</guid><author>INGNIGHT</author><pubDate>Sat, 10 Oct 2026 22:17:28 +0800</pubDate><description><![CDATA[dp[i][0]：到达第i个台阶时，已经进行了偶数次跳跃的方案数。dp[i][1]：到达第i个台阶时，已经进行了奇数次跳跃的方案数。，表示在起点（顶部）还未跳跃，跳跃次数为 0（偶数）。]]></description><category></category></item><item><title><![CDATA[944 · 最大子矩阵（前缀和）]]></title><link>https://blog.youkuaiyun.com/INGNIGHT/article/details/167491124</link><guid>https://blog.youkuaiyun.com/INGNIGHT/article/details/167491124</guid><author>INGNIGHT</author><pubDate>Sat, 10 Oct 2026 15:17:08 +0800</pubDate><description><![CDATA[【代码】944 · 最大子矩阵（前缀和）]]></description><category></category></item><item><title><![CDATA[778 · 太平洋和大西洋的水流（bfs）]]></title><link>https://blog.youkuaiyun.com/INGNIGHT/article/details/167027523</link><guid>https://blog.youkuaiyun.com/INGNIGHT/article/details/167027523</guid><author>INGNIGHT</author><pubDate>Sat, 03 Oct 2026 22:50:56 +0800</pubDate><description><![CDATA[2.如果两个visited都是true，则加入结果集合。]]></description><category></category></item><item><title><![CDATA[1396 · 集合合并（并查集union find）]]></title><link>https://blog.youkuaiyun.com/INGNIGHT/article/details/166950089</link><guid>https://blog.youkuaiyun.com/INGNIGHT/article/details/166950089</guid><author>INGNIGHT</author><pubDate>Thu, 01 Oct 2026 22:48:50 +0800</pubDate><description><![CDATA[【代码】1396 · 集合合并（并查集union find）]]></description><category></category></item><item><title><![CDATA[1897 · 会议室 3（扫描线）]]></title><link>https://blog.youkuaiyun.com/INGNIGHT/article/details/166945831</link><guid>https://blog.youkuaiyun.com/INGNIGHT/article/details/166945831</guid><author>INGNIGHT</author><pubDate>Thu, 01 Oct 2026 14:19:26 +0800</pubDate><description><![CDATA[erase只在询问自然结束时才移除它，无法阻止它在存活期间被反复遍历。clear()则在第一次满员时就把所有等待中的询问一次性清空，保证每个询问只被处理一次。两者配合，才能避免超时。]]></description><category></category></item><item><title><![CDATA[最大距离（Trie，二叉树中距离最远的两个节点）]]></title><link>https://blog.youkuaiyun.com/INGNIGHT/article/details/166471530</link><guid>https://blog.youkuaiyun.com/INGNIGHT/article/details/166471530</guid><author>INGNIGHT</author><pubDate>Wed, 23 Sep 2026 11:52:22 +0800</pubDate><description><![CDATA[题解：距离最远的两个节点，有3中情况。把字符串变为Trie，]]></description><category></category></item></channel></rss>