<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[pythonwyw123321的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/pythonwyw123321</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; pythonwyw123321]]></copyright><item><title><![CDATA[树形DP-换根DP-简记]]></title><link>https://blog.youkuaiyun.com/pythonwyw123321/article/details/160304893</link><guid>https://blog.youkuaiyun.com/pythonwyw123321/article/details/160304893</guid><author>pythonwyw123321</author><pubDate>Sun, 19 Apr 2026 13:15:07 +0800</pubDate><description><![CDATA[第一题为模板。前333道题较为简单。后面考察一些思考，以及代码实现有细节（至少对我来说）。完结！]]></description><category></category></item><item><title><![CDATA[微积分-简记]]></title><link>https://blog.youkuaiyun.com/pythonwyw123321/article/details/159769035</link><guid>https://blog.youkuaiyun.com/pythonwyw123321/article/details/159769035</guid><author>pythonwyw123321</author><pubDate>Thu, 02 Apr 2026 19:32:16 +0800</pubDate><description><![CDATA[偷偷写微积分笔记吓死同学。当然我可能讲得不太好。毕竟我才学 QaQ。以及本人只是一个入门了解。]]></description><category></category></item><item><title><![CDATA[题解：P15571 [USACO26FEB] Strange Function B]]></title><link>https://blog.youkuaiyun.com/pythonwyw123321/article/details/158805415</link><guid>https://blog.youkuaiyun.com/pythonwyw123321/article/details/158805415</guid><author>pythonwyw123321</author><pubDate>Sun, 08 Mar 2026 12:19:52 +0800</pubDate><description><![CDATA[对于每一次询问，先将非全体为。，然后用初始化完的数据去累加。]]></description><category></category></item><item><title><![CDATA[矩阵乘法-简记]]></title><link>https://blog.youkuaiyun.com/pythonwyw123321/article/details/158804824</link><guid>https://blog.youkuaiyun.com/pythonwyw123321/article/details/158804824</guid><author>pythonwyw123321</author><pubDate>Sun, 08 Mar 2026 12:11:16 +0800</pubDate><description><![CDATA[本文介绍了矩阵乘法在算法竞赛中的应用，包括基础实现和优化技巧。首先展示了一个简单的矩阵乘法代码模板，然后详细讲解了如何将其应用于矩阵快速幂问题（P3390）。接着通过斐波那契数列（P1962）等例题，演示了如何用矩阵乘法优化递推问题，将时间复杂度从O(n)降低到O(logn)。文章还提供了P1939和P1349两道扩展题目的解题思路和代码实现，强调通过构建转移矩阵来解决不同形式的递推问题。最后指出这些题目本质上是相似的矩阵乘法应用，帮助读者掌握这一重要算法技巧。]]></description><category></category></item><item><title><![CDATA[全源最短路（Johnson）]]></title><link>https://blog.youkuaiyun.com/pythonwyw123321/article/details/148797761</link><guid>https://blog.youkuaiyun.com/pythonwyw123321/article/details/148797761</guid><author>pythonwyw123321</author><pubDate>Sat, 01 Nov 2025 20:18:11 +0800</pubDate><description><![CDATA[Johnson算法是一种高效处理带负权边的全源最短路径算法。通过添加超级源点并使用SPFA计算势能函数h(i)，将边权重新赋值为w'(u,v)=w(u,v)+h[u]-h[v]使其非负。然后对每个顶点跑Dijkstra算法，最后通过dis[u][v]=dis'[u][v]-h[u]+h[v]还原实际最短路。该算法时间复杂度为O(nm + n²logn)，优于Floyd的O(n³)，且能处理负权边（无负环情况）。文中给出了完整实现代码，包括SPFA检测负环和Dijkstra计算最短路的核心步骤。]]></description><category></category></item><item><title><![CDATA[P1776 宝物筛选 ]]></title><link>https://blog.youkuaiyun.com/pythonwyw123321/article/details/148774417</link><guid>https://blog.youkuaiyun.com/pythonwyw123321/article/details/148774417</guid><author>pythonwyw123321</author><pubDate>Thu, 19 Jun 2025 20:22:32 +0800</pubDate><description><![CDATA[他粗略估算了下每样宝物的价值，之后开始了宝物筛选工作：小 FF 有一个最大载重为 W 的采集车，洞穴里总共有 n 种宝物，每种宝物的价值为 vi​，重量为 wi​，每种宝物有 mi​ 件。小 FF 希望在采集车不超载的前提下，选择一些宝物装进采集车，使得它们的价值和最大。二进制每一个位置代表的含义: 1, 2, 4, 8 , 16, 32, 64, 128...对于 100% 的数据，n≤∑mi​≤10^5，0≤W≤4×10^4，1≤n≤100。小 FF 找到了王室的宝物室，里面堆满了无数价值连城的宝物。]]></description><category></category></item><item><title><![CDATA[bfs广度优先搜索]]></title><link>https://blog.youkuaiyun.com/pythonwyw123321/article/details/148770909</link><guid>https://blog.youkuaiyun.com/pythonwyw123321/article/details/148770909</guid><author>pythonwyw123321</author><pubDate>Thu, 19 Jun 2025 20:07:33 +0800</pubDate><description><![CDATA[摘要： 本文对比BFS与DFS算法，重点分析BFS求最短路径的特性及其实现。BFS通过队列逐层扩展，确保首次到达即为最短路径。文中给出BFS模板代码及四类典型应用：二维矩阵最短步数、电梯最少按键次数、迷宫连通块统计、机器人路径规划。其中，迷宫问题通过标记连通块优化查询，机器人题需处理障碍物边界和转向状态。最后总结BFS核心思路——确定队列存储内容（坐标/状态/步数）和入队条件，强调其适用于最短路径及状态空间搜索场景。]]></description><category></category></item><item><title><![CDATA[C++里的随机数]]></title><link>https://blog.youkuaiyun.com/pythonwyw123321/article/details/142617445</link><guid>https://blog.youkuaiyun.com/pythonwyw123321/article/details/142617445</guid><author>pythonwyw123321</author><pubDate>Sat, 28 Sep 2024 16:24:46 +0800</pubDate><description><![CDATA[这个是让你猜机器人想的数字,那下面的代码就是让机器人来猜你想的数字:(用二分)rand()%100+1//就是一个从一到一百的随机数。想用C++做最基础的猜数字,肯定少不了随机数;rand() //是生成一个随机数。]]></description><category></category></item><item><title><![CDATA[动态规划（有背包问题）]]></title><link>https://blog.youkuaiyun.com/pythonwyw123321/article/details/142615273</link><guid>https://blog.youkuaiyun.com/pythonwyw123321/article/details/142615273</guid><author>pythonwyw123321</author><pubDate>Sat, 28 Sep 2024 16:08:28 +0800</pubDate><description><![CDATA[是解决多阶段决策问题常用的最优化理论，该理论由美国数学家Bellman等人在1957年提出，用于研究多阶段决策过程的优化问题。动态规划方法的原理就是把多阶段决策过程转化为一系列的单阶段决策问题，利用各个阶段之间的递推关系，逐个确定每个阶段的最优化决策，最终堆看出多阶段决策的最优化决策结果。动态规划适合求解多阶段(状态转换)决策问题的最优解，决策的阶段可以随时间划分也可以随着问题的演化状态划分。问题都具有的一个性质就是“最优子结构”。而动态规划的重点就是在于找出状态转移方程。]]></description><category></category></item><item><title><![CDATA[反弹球python小游戏]]></title><link>https://blog.youkuaiyun.com/pythonwyw123321/article/details/140300552</link><guid>https://blog.youkuaiyun.com/pythonwyw123321/article/details/140300552</guid><author>pythonwyw123321</author><pubDate>Tue, 09 Jul 2024 16:55:14 +0800</pubDate><description><![CDATA[下面的代码也是Ls类里面的,作用是判断是否碰到边缘,如果碰到边缘大小减小,如果我们的大小为零或者负数,把这个对象删除。]]></description><category></category></item><item><title><![CDATA[区间贪心]]></title><link>https://blog.youkuaiyun.com/pythonwyw123321/article/details/140278208</link><guid>https://blog.youkuaiyun.com/pythonwyw123321/article/details/140278208</guid><author>pythonwyw123321</author><pubDate>Tue, 09 Jul 2024 15:01:10 +0800</pubDate><description><![CDATA[贪心算法是从问题的初始状态出发，通过若干次的贪心选择而得到的最优值(或较优值)的1种求解问题策略，即贪心策略。]]></description><category></category></item><item><title><![CDATA[浏览器的一些功能]]></title><link>https://blog.youkuaiyun.com/pythonwyw123321/article/details/134221943</link><guid>https://blog.youkuaiyun.com/pythonwyw123321/article/details/134221943</guid><author>pythonwyw123321</author><pubDate>Sat, 25 May 2024 19:09:11 +0800</pubDate><description><![CDATA[点浏览器右上角的三个点也就是一个...点了设置你可以在这里改它的颜色还有页面。]]></description><category></category></item><item><title><![CDATA[用Python Pygame做的一些好玩的小游戏]]></title><link>https://blog.youkuaiyun.com/pythonwyw123321/article/details/139201606</link><guid>https://blog.youkuaiyun.com/pythonwyw123321/article/details/139201606</guid><author>pythonwyw123321</author><pubDate>Sat, 25 May 2024 19:01:18 +0800</pubDate><description><![CDATA[你要准备的图片：命名为：ji.png。]]></description><category></category></item><item><title><![CDATA[电脑的操作技能]]></title><link>https://blog.youkuaiyun.com/pythonwyw123321/article/details/138540766</link><guid>https://blog.youkuaiyun.com/pythonwyw123321/article/details/138540766</guid><author>pythonwyw123321</author><pubDate>Wed, 22 May 2024 19:19:45 +0800</pubDate><description><![CDATA[有时候你会发现电脑死机了有些程序关不掉(或者卡了,中病毒了),怎么办呢?其实操作十分的简单,这种方法大部分程序都可以关掉.]]></description><category></category></item><item><title><![CDATA[Python绘制的好看统计图]]></title><link>https://blog.youkuaiyun.com/pythonwyw123321/article/details/138375045</link><guid>https://blog.youkuaiyun.com/pythonwyw123321/article/details/138375045</guid><author>pythonwyw123321</author><pubDate>Wed, 01 May 2024 16:27:05 +0800</pubDate><description><![CDATA[【代码】Python绘制的好看统计图。]]></description><category></category></item><item><title><![CDATA[记忆化递归]]></title><link>https://blog.youkuaiyun.com/pythonwyw123321/article/details/138373041</link><guid>https://blog.youkuaiyun.com/pythonwyw123321/article/details/138373041</guid><author>pythonwyw123321</author><pubDate>Wed, 01 May 2024 15:51:03 +0800</pubDate><description><![CDATA[你应该知道斐波那契数列吧！就是前两项之和等于这一项。如果你学过递归，你肯定会写这道题：输入一个N代表你要求的项数，然后输出斐波那契的第N项。这道题看似简单，实则特别困难（对于大数据来说）。如果我们用C++运行这段代码，你会发现如果我们输入50，它就会加载很久。肯定会超时！！！！！！！！！！！！！！！！！！！！！！！！！！！！！(っ °Д °;)っ。]]></description><category></category></item><item><title><![CDATA[二分查找做的小游戏]]></title><link>https://blog.youkuaiyun.com/pythonwyw123321/article/details/137286869</link><guid>https://blog.youkuaiyun.com/pythonwyw123321/article/details/137286869</guid><author>pythonwyw123321</author><pubDate>Tue, 02 Apr 2024 20:05:33 +0800</pubDate><description><![CDATA[int mid;return mid;r = mid-1;l = mid+1;return -1;cin >> n;i < n;cin >> x;return 0;那是不是可以让c++做一个你想我猜的小游戏呢?]]></description><category></category></item><item><title><![CDATA[Python中输出显示台的设置]]></title><link>https://blog.youkuaiyun.com/pythonwyw123321/article/details/137284877</link><guid>https://blog.youkuaiyun.com/pythonwyw123321/article/details/137284877</guid><author>pythonwyw123321</author><pubDate>Tue, 02 Apr 2024 19:15:52 +0800</pubDate><description><![CDATA[这种文字显示的方式很适合新手来学习,毕竟新手还学不到pygame做游戏的, Python入门我们一般都学的是输入输出的游戏,但是如果加上一些文字和背景的改善可能会更好.]]></description><category></category></item><item><title><![CDATA[高效的算法设计]]></title><link>https://blog.youkuaiyun.com/pythonwyw123321/article/details/137281440</link><guid>https://blog.youkuaiyun.com/pythonwyw123321/article/details/137281440</guid><author>pythonwyw123321</author><pubDate>Tue, 02 Apr 2024 19:08:49 +0800</pubDate><description><![CDATA[简单的动态规划
]]></description><category></category></item><item><title><![CDATA[高精度c++]]></title><link>https://blog.youkuaiyun.com/pythonwyw123321/article/details/136758956</link><guid>https://blog.youkuaiyun.com/pythonwyw123321/article/details/136758956</guid><author>pythonwyw123321</author><pubDate>Sat, 16 Mar 2024 11:21:03 +0800</pubDate><description><![CDATA[中间计算过程是先乘再进位。]]></description><category></category></item></channel></rss>