<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[dakingffo的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/dakingffo</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; dakingffo]]></copyright><item><title><![CDATA[「动态规划::数位DP」统计数字递推 / LeetCode 3352|1012（C++）]]></title><link>https://blog.youkuaiyun.com/dakingffo/article/details/148702343</link><guid>https://blog.youkuaiyun.com/dakingffo/article/details/148702343</guid><author>dakingffo</author><pubDate>Mon, 16 Jun 2025 23:55:31 +0800</pubDate><description><![CDATA[这一节的数位DP要与我们之前介绍的线性DP、状压DP结合。]]></description><category></category></item><item><title><![CDATA[「动态规划::数位DP」相邻数位递推 / Luogu P2657|LeetCode 600（C++）]]></title><link>https://blog.youkuaiyun.com/dakingffo/article/details/148597324</link><guid>https://blog.youkuaiyun.com/dakingffo/article/details/148597324</guid><author>dakingffo</author><pubDate>Thu, 12 Jun 2025 01:43:55 +0800</pubDate><description><![CDATA[我们来介绍最基本的数位DP：相邻数位递推。]]></description><category></category></item><item><title><![CDATA[「动态规划::状压DP」网格图递推 / AcWing 292|327（C++）]]></title><link>https://blog.youkuaiyun.com/dakingffo/article/details/148316476</link><guid>https://blog.youkuaiyun.com/dakingffo/article/details/148316476</guid><author>dakingffo</author><pubDate>Thu, 29 May 2025 21:09:04 +0800</pubDate><description><![CDATA[如果我们有一张地图，要求是在符合某类条件的前提在地图上放置最优解，该怎么计算？]]></description><category></category></item><item><title><![CDATA[「动态规划::状压DP」旅行商问题（TSP|最短哈密尔顿回路） / AcWing 91 | LeetCode 847|943（C++）]]></title><link>https://blog.youkuaiyun.com/dakingffo/article/details/148242664</link><guid>https://blog.youkuaiyun.com/dakingffo/article/details/148242664</guid><author>dakingffo</author><pubDate>Wed, 28 May 2025 02:03:35 +0800</pubDate><description><![CDATA[TSP，也就是旅行商问题，是给定一系列城市和每对城市之间的距离，求解访问每一座城市一次并回到起始城市的最短回路的问题，而这个回路也称为最短哈密尔顿回路。]]></description><category></category></item><item><title><![CDATA[「动态规划::状压DP」双数组排列问题 / LeetCode 1879|2850（C++）]]></title><link>https://blog.youkuaiyun.com/dakingffo/article/details/148122526</link><guid>https://blog.youkuaiyun.com/dakingffo/article/details/148122526</guid><author>dakingffo</author><pubDate>Thu, 22 May 2025 01:04:40 +0800</pubDate><description><![CDATA[什么是状态压缩？就是将一系列状态压缩进一个二进制数中。]]></description><category></category></item><item><title><![CDATA[「动态规划::背包DP」多重背包 / 二进制优化|单调队列优化 / AcWing 4|5|6（C++）]]></title><link>https://blog.youkuaiyun.com/dakingffo/article/details/147990399</link><guid>https://blog.youkuaiyun.com/dakingffo/article/details/147990399</guid><author>dakingffo</author><pubDate>Wed, 21 May 2025 02:14:13 +0800</pubDate><description><![CDATA[多重背包是背包问题中较为复杂的一个问题，我们将依次介绍朴素算法、二进制优化、单调队列优化，来依次解决AcWing 4、5、6。]]></description><category></category></item><item><title><![CDATA[「数学::博弈论」Nim游戏（尼姆游戏）/ Luogu P2197（C++）]]></title><link>https://blog.youkuaiyun.com/dakingffo/article/details/147952882</link><guid>https://blog.youkuaiyun.com/dakingffo/article/details/147952882</guid><author>dakingffo</author><pubDate>Wed, 14 May 2025 15:09:05 +0800</pubDate><description><![CDATA[泰山崩于前而色不变，麋鹿兴于左而目不瞬，然后可以制利害，可以待敌。]]></description><category></category></item><item><title><![CDATA[「动态规划::线性DP」股票问题合集 / LeetCode 121|122|123|188 （C++）]]></title><link>https://blog.youkuaiyun.com/dakingffo/article/details/147773060</link><guid>https://blog.youkuaiyun.com/dakingffo/article/details/147773060</guid><author>dakingffo</author><pubDate>Wed, 07 May 2025 21:19:54 +0800</pubDate><description><![CDATA[我们已经了解过了线性DP：
更进一步，我们来解决非常经典的线性DP问题系列：买卖股票。]]></description><category></category></item><item><title><![CDATA[「队列」单调队列 / LeetCode 239（C++）]]></title><link>https://blog.youkuaiyun.com/dakingffo/article/details/147701423</link><guid>https://blog.youkuaiyun.com/dakingffo/article/details/147701423</guid><author>dakingffo</author><pubDate>Sun, 04 May 2025 17:49:01 +0800</pubDate><description><![CDATA[长江后浪推前浪，一代新人换旧人。我们来讲：单调队列。]]></description><category></category></item><item><title><![CDATA[「动态规划::背包DP」分组背包 / AcWing 9（C++）]]></title><link>https://blog.youkuaiyun.com/dakingffo/article/details/147674002</link><guid>https://blog.youkuaiyun.com/dakingffo/article/details/147674002</guid><author>dakingffo</author><pubDate>Sat, 03 May 2025 01:17:51 +0800</pubDate><description><![CDATA[分组背包是变形的完全背包，这次给物品加了一个分组属性，也就是说，这次是对物品组进行01背包。]]></description><category></category></item><item><title><![CDATA[「动态规划::背包DP」完全背包 / AcWing 3（C++）]]></title><link>https://blog.youkuaiyun.com/dakingffo/article/details/147673870</link><guid>https://blog.youkuaiyun.com/dakingffo/article/details/147673870</guid><author>dakingffo</author><pubDate>Sat, 03 May 2025 00:49:51 +0800</pubDate><description><![CDATA[​01背包探讨的是选与不选的问题，而完全背包探讨的是在可无限重复选择物品的问题。]]></description><category></category></item><item><title><![CDATA[「动态规划::背包DP」01背包 / AcWing 2（C++）]]></title><link>https://blog.youkuaiyun.com/dakingffo/article/details/147640051</link><guid>https://blog.youkuaiyun.com/dakingffo/article/details/147640051</guid><author>dakingffo</author><pubDate>Wed, 30 Apr 2025 21:48:56 +0800</pubDate><description><![CDATA[背包DP是非常经典的动态规划问题，而01背包更是典中典问题。]]></description><category></category></item><item><title><![CDATA[「动态规划::线性DP」最长上升子序列（LIS）|编辑距离 / LeetCode 300|72（C++）]]></title><link>https://blog.youkuaiyun.com/dakingffo/article/details/147638749</link><guid>https://blog.youkuaiyun.com/dakingffo/article/details/147638749</guid><author>dakingffo</author><pubDate>Wed, 30 Apr 2025 20:50:44 +0800</pubDate><description><![CDATA[DP，即动态规划是解决最优化问题的一类算法，我们要通过将原始问题分解成规模更小的、相似的子问题，通过求解这些易求解的子问题来计算原始问题。
线性DP是一类基本DP，我们来通过它感受DP算法的奥义。]]></description><category></category></item><item><title><![CDATA[「数学::数论」分解质因子 / LeetCode 2521（C++）]]></title><link>https://blog.youkuaiyun.com/dakingffo/article/details/145373299</link><guid>https://blog.youkuaiyun.com/dakingffo/article/details/145373299</guid><author>dakingffo</author><pubDate>Mon, 27 Jan 2025 00:38:21 +0800</pubDate><description><![CDATA[由算数基本定理，我们知道任意一个大于1的自然数可以表示为一些质数的乘积，该怎么用算法描述呢？]]></description><category></category></item><item><title><![CDATA[「STL::array」标准库容器：array（数组）介绍（C++）]]></title><link>https://blog.youkuaiyun.com/dakingffo/article/details/143597342</link><guid>https://blog.youkuaiyun.com/dakingffo/article/details/143597342</guid><author>dakingffo</author><pubDate>Thu, 07 Nov 2024 16:23:40 +0800</pubDate><description><![CDATA[array 是一种C++标准模板库STL中定义的一种序列容器，它提供了对数组的初步封装。]]></description><category></category></item><item><title><![CDATA[「图::连通」详解并查集并实现对应的功能 / 数据结构模版（C++）]]></title><link>https://blog.youkuaiyun.com/dakingffo/article/details/143081327</link><guid>https://blog.youkuaiyun.com/dakingffo/article/details/143081327</guid><author>dakingffo</author><pubDate>Sat, 19 Oct 2024 17:59:32 +0800</pubDate><description><![CDATA[并查集，故名思议，能合并、能查询的集合,在图的连通性问题和许多算法优化上着广泛的使用。]]></description><category></category></item><item><title><![CDATA[「数学::快速幂」矩阵快速幂运算|快速斐波那契数列 / LeetCode 509（C++）]]></title><link>https://blog.youkuaiyun.com/dakingffo/article/details/143080024</link><guid>https://blog.youkuaiyun.com/dakingffo/article/details/143080024</guid><author>dakingffo</author><pubDate>Sat, 19 Oct 2024 17:14:01 +0800</pubDate><description><![CDATA[快速幂不仅可以用于求数的幂，也可以求矩阵的幂，进而进行将一些递推算法优化成logn算法。]]></description><category></category></item><item><title><![CDATA[「堆」对顶堆 / LeetCode 295（C++）]]></title><link>https://blog.youkuaiyun.com/dakingffo/article/details/142892436</link><guid>https://blog.youkuaiyun.com/dakingffo/article/details/142892436</guid><author>dakingffo</author><pubDate>Sun, 13 Oct 2024 02:52:24 +0800</pubDate><description><![CDATA[对顶堆可以在元素动态变化时维护第k小/大的元素。]]></description><category></category></item><item><title><![CDATA[「字符串」Z函数（扩展KMP|exKMP）/ LeetCode 2223（C++）]]></title><link>https://blog.youkuaiyun.com/dakingffo/article/details/142798877</link><guid>https://blog.youkuaiyun.com/dakingffo/article/details/142798877</guid><author>dakingffo</author><pubDate>Thu, 10 Oct 2024 00:35:32 +0800</pubDate><description><![CDATA[Z函数是一种独到的匹配算法，虽然国内称之为扩展KMP，其实他更具有Manacher算法的特征。与KMP类似的是，它也是字符串自匹配问题。]]></description><category></category></item><item><title><![CDATA[「数组」二分答案 / LeetCode 1870（C++）]]></title><link>https://blog.youkuaiyun.com/dakingffo/article/details/142683148</link><guid>https://blog.youkuaiyun.com/dakingffo/article/details/142683148</guid><author>dakingffo</author><pubDate>Wed, 02 Oct 2024 18:12:37 +0800</pubDate><description><![CDATA[区别于二分查找对数组下标进行二分，二分答案是对一个与数组无关的实数域进行二分，并将二分得到的值作用于数组判断可行性的过程。]]></description><category></category></item></channel></rss>