<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[chen0708chen的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/chen0708chen</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; chen0708chen]]></copyright><item><title><![CDATA[K. Dice Game（ICPC）]]></title><link>https://blog.youkuaiyun.com/chen0708chen/article/details/146606109</link><guid>https://blog.youkuaiyun.com/chen0708chen/article/details/146606109</guid><author>chen0708chen</author><pubDate>Fri, 28 Mar 2025 17:23:15 +0800</pubDate><description><![CDATA[ICPC备赛]]></description><category></category></item><item><title><![CDATA[完全背包模板]]></title><link>https://blog.youkuaiyun.com/chen0708chen/article/details/146540507</link><guid>https://blog.youkuaiyun.com/chen0708chen/article/details/146540507</guid><author>chen0708chen</author><pubDate>Wed, 26 Mar 2025 20:42:19 +0800</pubDate><description><![CDATA[完全背包]]></description><category></category></item><item><title><![CDATA[01背包模板]]></title><link>https://blog.youkuaiyun.com/chen0708chen/article/details/146540280</link><guid>https://blog.youkuaiyun.com/chen0708chen/article/details/146540280</guid><author>chen0708chen</author><pubDate>Wed, 26 Mar 2025 20:30:22 +0800</pubDate><description><![CDATA[01背包模板]]></description><category></category></item><item><title><![CDATA[L2-3 龙龙送外卖（天梯赛）]]></title><link>https://blog.youkuaiyun.com/chen0708chen/article/details/146539800</link><guid>https://blog.youkuaiyun.com/chen0708chen/article/details/146539800</guid><author>chen0708chen</author><pubDate>Wed, 26 Mar 2025 20:07:06 +0800</pubDate><description><![CDATA[L2-3 龙龙送外卖（天梯赛）]]></description><category></category></item><item><title><![CDATA[L2-4 大众情人（天梯赛）]]></title><link>https://blog.youkuaiyun.com/chen0708chen/article/details/146505344</link><guid>https://blog.youkuaiyun.com/chen0708chen/article/details/146505344</guid><author>chen0708chen</author><pubDate>Tue, 25 Mar 2025 15:54:42 +0800</pubDate><description><![CDATA[天梯赛]]></description><category></category></item><item><title><![CDATA[J. John in the Amusement Park（动态规划）]]></title><link>https://blog.youkuaiyun.com/chen0708chen/article/details/146493060</link><guid>https://blog.youkuaiyun.com/chen0708chen/article/details/146493060</guid><author>chen0708chen</author><pubDate>Tue, 25 Mar 2025 08:55:21 +0800</pubDate><description><![CDATA[J. John in the Amusement Park（动态规划）]]></description><category></category></item><item><title><![CDATA[PTA 7-7（选做） 旅游规划]]></title><link>https://blog.youkuaiyun.com/chen0708chen/article/details/146363189</link><guid>https://blog.youkuaiyun.com/chen0708chen/article/details/146363189</guid><author>chen0708chen</author><pubDate>Wed, 19 Mar 2025 10:48:49 +0800</pubDate><description><![CDATA[dijkstra拓展，同时考虑距离和费用]]></description><category></category></item><item><title><![CDATA[c++控制小数精度和四舍五入]]></title><link>https://blog.youkuaiyun.com/chen0708chen/article/details/146353533</link><guid>https://blog.youkuaiyun.com/chen0708chen/article/details/146353533</guid><author>chen0708chen</author><pubDate>Tue, 18 Mar 2025 21:53:40 +0800</pubDate><description><![CDATA[浮点数控制精度和四舍五入]]></description><category></category></item><item><title><![CDATA[优先队列Dijkstra模板]]></title><link>https://blog.youkuaiyun.com/chen0708chen/article/details/146201410</link><guid>https://blog.youkuaiyun.com/chen0708chen/article/details/146201410</guid><author>chen0708chen</author><pubDate>Wed, 12 Mar 2025 12:00:52 +0800</pubDate><description><![CDATA[学习最短路的Dijkstra算法后，在此记录模板以防忘记。]]></description><category></category></item><item><title><![CDATA[病毒在封闭空间中的传播时间]]></title><link>https://blog.youkuaiyun.com/chen0708chen/article/details/146113576</link><guid>https://blog.youkuaiyun.com/chen0708chen/article/details/146113576</guid><author>chen0708chen</author><pubDate>Sat, 08 Mar 2025 11:54:38 +0800</pubDate><description><![CDATA[这道题描述了一个基于网格的感染传播问题，其中病毒从一个感染者开始，并按照特定规则传播到整个房间。房间中每个人的感染概率受到其是否佩戴口罩的影响，这影响了病毒传播的速度。该问题是一个带权的最短路径问题，类似于广度优先搜索（BFS），但由于病毒传播受到特定规则的约束，这使得其传播速度并不统一，因此需要在标准BFS的基础上加入额外逻辑处理。]]></description><category></category></item><item><title><![CDATA[树状数组模板1（单点修改，区间查询）]]></title><link>https://blog.youkuaiyun.com/chen0708chen/article/details/146113424</link><guid>https://blog.youkuaiyun.com/chen0708chen/article/details/146113424</guid><author>chen0708chen</author><pubDate>Sat, 08 Mar 2025 11:34:51 +0800</pubDate><description><![CDATA[树状数组模板1]]></description><category></category></item><item><title><![CDATA[差分的理解（求导）及例题]]></title><link>https://blog.youkuaiyun.com/chen0708chen/article/details/146044951</link><guid>https://blog.youkuaiyun.com/chen0708chen/article/details/146044951</guid><author>chen0708chen</author><pubDate>Wed, 05 Mar 2025 15:57:39 +0800</pubDate><description><![CDATA[差分的理解]]></description><category></category></item><item><title><![CDATA[kruskal最小生成树模板]]></title><link>https://blog.youkuaiyun.com/chen0708chen/article/details/146016985</link><guid>https://blog.youkuaiyun.com/chen0708chen/article/details/146016985</guid><author>chen0708chen</author><pubDate>Tue, 04 Mar 2025 15:20:31 +0800</pubDate><description><![CDATA[kruskal模板]]></description><category></category></item><item><title><![CDATA[单调栈模板经典例题]]></title><link>https://blog.youkuaiyun.com/chen0708chen/article/details/145910859</link><guid>https://blog.youkuaiyun.com/chen0708chen/article/details/145910859</guid><author>chen0708chen</author><pubDate>Thu, 27 Feb 2025 18:20:40 +0800</pubDate><description><![CDATA[单调栈模板例题]]></description><category></category></item><item><title><![CDATA[并查集（路径压缩)]]></title><link>https://blog.youkuaiyun.com/chen0708chen/article/details/145904745</link><guid>https://blog.youkuaiyun.com/chen0708chen/article/details/145904745</guid><author>chen0708chen</author><pubDate>Thu, 27 Feb 2025 15:05:43 +0800</pubDate><description><![CDATA[并查集（路径压缩）模板]]></description><category></category></item><item><title><![CDATA[欧拉筛（线性筛）模板]]></title><link>https://blog.youkuaiyun.com/chen0708chen/article/details/145734970</link><guid>https://blog.youkuaiyun.com/chen0708chen/article/details/145734970</guid><author>chen0708chen</author><pubDate>Wed, 19 Feb 2025 17:36:10 +0800</pubDate><description><![CDATA[【代码】欧拉筛（线性筛）模板。]]></description><category></category></item><item><title><![CDATA[优化快速幂求排列组合]]></title><link>https://blog.youkuaiyun.com/chen0708chen/article/details/143887866</link><guid>https://blog.youkuaiyun.com/chen0708chen/article/details/143887866</guid><author>chen0708chen</author><pubDate>Tue, 19 Nov 2024 16:06:14 +0800</pubDate><description><![CDATA[前几天周赛一道题考到了排列组合，不过只会暴力求解，答案肯定是超时的，然后学习了一下快速幂求排列组合，并作出了一点优化。常规快速幂排列组合可以看其他博主的文章，在此不做赘述。常规时间复杂度：O(n⋅log(mod))的次数，只需调用一次快速幂计算最大的阶乘逆元即可，其余通过递推计算完成。时间复杂度：O(n) 递推 + 1 次快速幂 (O(log⁡(mod)))然后注意点是要知道mod不是任意值，mod必须是素数，然后要比a，b大。是模意义下的阶乘逆元，因此在功能和结果和常规的上是一致的。只需调用一次快速幂。]]></description><category></category></item><item><title><![CDATA[java小白写题遇见的问题（1）]]></title><link>https://blog.youkuaiyun.com/chen0708chen/article/details/142024357</link><guid>https://blog.youkuaiyun.com/chen0708chen/article/details/142024357</guid><author>chen0708chen</author><pubDate>Sun, 08 Sep 2024 11:45:22 +0800</pubDate><description><![CDATA[java小白写题中出现的问题总结1]]></description><category></category></item><item><title><![CDATA[Linux学习笔记（1，指令篇）]]></title><link>https://blog.youkuaiyun.com/chen0708chen/article/details/141994822</link><guid>https://blog.youkuaiyun.com/chen0708chen/article/details/141994822</guid><author>chen0708chen</author><pubDate>Sat, 07 Sep 2024 13:56:13 +0800</pubDate><description><![CDATA[Linux学习笔记]]></description><category></category></item><item><title><![CDATA[迷宫，返回所有路径并排序（C++)(回溯+dfs）]]></title><link>https://blog.youkuaiyun.com/chen0708chen/article/details/141994686</link><guid>https://blog.youkuaiyun.com/chen0708chen/article/details/141994686</guid><author>chen0708chen</author><pubDate>Sat, 07 Sep 2024 13:44:22 +0800</pubDate><description><![CDATA[迷宫c++，回溯，dfs]]></description><category></category></item></channel></rss>