<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[天生我材必有用，千金散尽还复来。]]></title><description><![CDATA[]]></description><link>https://blog.csdn.net/write_1m_lines</link><language>zh-cn</language><generator>https://blog.csdn.net/</generator><copyright><![CDATA[Copyright &copy; write_1m_lines]]></copyright><item><title><![CDATA[放弃CSDN博客公告]]></title><link>https://blog.csdn.net/write_1m_lines/article/details/144947856</link><guid>https://blog.csdn.net/write_1m_lines/article/details/144947856</guid><author>write_1m_lines</author><pubDate>Sun, 05 Jan 2025 16:57:25 +0800</pubDate><description><![CDATA[由于各种原因，本人决定放弃CSDN博客。原有博文将会保留在此账号下，以后的新博文可能也会不定期同步到这里。CSDN的朋友们大家好。这是我自2020年发布。]]></description><category></category></item><item><title><![CDATA[Mathematica 入门]]></title><link>https://blog.csdn.net/write_1m_lines/article/details/135851944</link><guid>https://blog.csdn.net/write_1m_lines/article/details/135851944</guid><author>write_1m_lines</author><pubDate>Fri, 26 Jan 2024 17:11:30 +0800</pubDate><description><![CDATA[一篇内容相对全面的 Mathematica 入门教程……]]></description><category></category></item><item><title><![CDATA[UNIQUE VISION Programming Contest 2023 Christmas (AtCoder Beginner Contest 334) A~G 题解]]></title><link>https://blog.csdn.net/write_1m_lines/article/details/135178286</link><guid>https://blog.csdn.net/write_1m_lines/article/details/135178286</guid><author>write_1m_lines</author><pubDate>Sun, 24 Dec 2023 12:05:04 +0800</pubDate><description><![CDATA[UNIQUE VISION Programming Contest 2023 Christmas (AtCoder Beginner Contest 334) A~G 题解
A - Christmas Present
B - Christmas Trees
C - Socks 2
D - Reindeer and Sleigh
E - Christmas Color Grid 1
F - Christmas Present 2
G - Christmas Color Grid 2]]></description><category></category></item><item><title><![CDATA[洛谷 P9754 [CSP-S 2023] 结构体 题解]]></title><link>https://blog.csdn.net/write_1m_lines/article/details/134758697</link><guid>https://blog.csdn.net/write_1m_lines/article/details/134758697</guid><author>write_1m_lines</author><pubDate>Sat, 02 Dec 2023 22:21:02 +0800</pubDate><description><![CDATA[由于DataTypestring s;int k;string t;根据「基本思路」中给出的做法，维护当前第一个可分配的地址和顶层元素列表Object// 类型// 名称LL addr;// 地址计算地址并保存元素Object obj;string t;// 输入// 找到类型指针// 对齐// 更新可分配的地址// 保存元素输出元素地址。]]></description><category></category></item><item><title><![CDATA[AtCoder Beginner Contest 318 G - Typical Path Problem 题解]]></title><link>https://blog.csdn.net/write_1m_lines/article/details/132646902</link><guid>https://blog.csdn.net/write_1m_lines/article/details/132646902</guid><author>write_1m_lines</author><pubDate>Sun, 03 Sep 2023 13:27:38 +0800</pubDate><description><![CDATA[ABC318 G - Typical Path Problem 题解
本题可以使用最大流或圆方树解决。]]></description><category></category></item><item><title><![CDATA[TOYOTA MOTOR CORPORATION Programming Contest 2023#1 (AtCoder Beginner Contest 298) A~G 题解]]></title><link>https://blog.csdn.net/write_1m_lines/article/details/130186306</link><guid>https://blog.csdn.net/write_1m_lines/article/details/130186306</guid><author>write_1m_lines</author><pubDate>Wed, 19 Apr 2023 18:34:10 +0800</pubDate><description><![CDATA[A - Job Interview
B - Coloring Matrix
C - Cards Query Problem
D - Writing a Numeral
E - Unfair Sugoroku
F - Rook Score
G - Strawberry War
H - Sum of Min of Length]]></description><category></category></item><item><title><![CDATA[【算法笔记】最近公共祖先（LCA）问题求解——倍增算法]]></title><link>https://blog.csdn.net/write_1m_lines/article/details/128573395</link><guid>https://blog.csdn.net/write_1m_lines/article/details/128573395</guid><author>write_1m_lines</author><pubDate>Fri, 06 Jan 2023 23:03:23 +0800</pubDate><description><![CDATA[最近公共祖先简称 LCA（Lowest Common Ancestor）。两个节点的最近公共祖先，就是这两个点的公共祖先里面，离根最远的那个。这种算法应用很广泛，可以很容易解决树上最短路等问题。为了方便，我们记某点集Sv1v2vnSv1​v2​vn​的最近公共祖先为LCAv1v2vnLCAv1​v2​vn​或LCASLCAS。部分内容参考OI Wiki，文章中所有算法均使用C++实现。]]></description><category></category></item><item><title><![CDATA[【算法笔记】【专题】RMQ 问题：ST表/树状数组/线段树]]></title><link>https://blog.csdn.net/write_1m_lines/article/details/128554028</link><guid>https://blog.csdn.net/write_1m_lines/article/details/128554028</guid><author>write_1m_lines</author><pubDate>Thu, 05 Jan 2023 22:48:22 +0800</pubDate><description><![CDATA[好久没更算法笔记专栏了，正好学了新算法来更新……
本文将讲解用于求解 RMQ 问题的三种数据结构：
- ST 表（Sparse Table）
- 树状数组
- 线段树]]></description><category></category></item><item><title><![CDATA[AtCoder Beginner Contest 274 A~E 题解]]></title><link>https://blog.csdn.net/write_1m_lines/article/details/127478318</link><guid>https://blog.csdn.net/write_1m_lines/article/details/127478318</guid><author>write_1m_lines</author><pubDate>Mon, 24 Oct 2022 08:30:00 +0800</pubDate><description><![CDATA[A - Batting Average
B - Line Sensor
C - Ameba
D - Robot Arms 2
E - Booster]]></description><category></category></item><item><title><![CDATA[【算法笔记】位运算详解]]></title><link>https://blog.csdn.net/write_1m_lines/article/details/127348960</link><guid>https://blog.csdn.net/write_1m_lines/article/details/127348960</guid><author>write_1m_lines</author><pubDate>Tue, 18 Oct 2022 08:30:00 +0800</pubDate><description><![CDATA[突然想到位运算是个好东西，就来水一波文章了……注意：我把能想到的有关位运算的所有内容都放进来了，所以篇幅较长，请谅解！若有写的不清楚或者不够详细的地方欢迎在评论区补充，谢谢支持！本文中参考代码均使用C++编写。废话不多说，下面步入正题。有一定基础的可以跳过该部分。 位运算分为如下几种：取反（）是最简单的位运算操作，只有一个参数xxx。将参数上的每一位对应取反即可。例如：


性质：按位与（）有两个参数xxx和yyy。对于xxx和yyy中的每个对应位，参照下表输出到结果的对应位：例子：

性质：按位与（）有两]]></description><category></category></item><item><title><![CDATA[【算法笔记】树状数组/Binary Indexed Tree/Fenwick Tree]]></title><link>https://blog.csdn.net/write_1m_lines/article/details/126441412</link><guid>https://blog.csdn.net/write_1m_lines/article/details/126441412</guid><author>write_1m_lines</author><pubDate>Sat, 20 Aug 2022 20:08:23 +0800</pubDate><description><![CDATA[树状数组，即树形存储的数组，又称或。抛开它树形的存储结构，这种神奇的数据结构的应用看起来与「 树」没什么关系：有一个序列A=(A1,A2,…,AN)A=(A1​,A2​,…,AN​)，在不超过O(log⁡N)O(logN)→\to~→求[L,R][L,R][L,R]区间内所有数之和。→\to~→指定一个元素AxA_xAx​，将其加上kkk。]]></description><category></category></item><item><title><![CDATA[【算法笔记】三种背包问题——背包 DP]]></title><link>https://blog.csdn.net/write_1m_lines/article/details/126385779</link><guid>https://blog.csdn.net/write_1m_lines/article/details/126385779</guid><author>write_1m_lines</author><pubDate>Thu, 18 Aug 2022 19:04:52 +0800</pubDate><description><![CDATA[背包（Knapsack）问题是经典的动态规划问题，也很有实际价值。这是最原始的01背包问题（即每个物品只能选000或111次）。下面我们来看如何求解。
令fi,jf_{i,j}fi,j​表示只考虑前iii个物品的情况下，容量为jjj的背包所能装的最大总价值。则最终答案为fn,Wf_{n,W}fn,W​，状态转移方程为：...]]></description><category></category></item><item><title><![CDATA[【算法笔记】Kruskal/Prim算法——求解最小生成树问题]]></title><link>https://blog.csdn.net/write_1m_lines/article/details/126330162</link><guid>https://blog.csdn.net/write_1m_lines/article/details/126330162</guid><author>write_1m_lines</author><pubDate>Mon, 15 Aug 2022 11:43:06 +0800</pubDate><description><![CDATA[最小生成树问题：给定一张带权无向图G，求它的一棵生成树，使其中所有边权之和最小。本文将介绍针对这种问题的两种经典算法——Kruskal和Prim。]]></description><category></category></item><item><title><![CDATA[【算法笔记】单源最短路问题——Dijkstra算法（无优化/优先队列/set优化）]]></title><link>https://blog.csdn.net/write_1m_lines/article/details/126316941</link><guid>https://blog.csdn.net/write_1m_lines/article/details/126316941</guid><author>write_1m_lines</author><pubDate>Sat, 13 Aug 2022 12:37:23 +0800</pubDate><description><![CDATA[Dijkstra算法可在O(mlog⁡m)O(mlogm)或O(mlog⁡n)O(mlogn)的时间内求解无负权单源最短路问题。本文中，我们将详细介绍算法的原理、实现，以及常用的两种优化。另外，Dijkstra算法也不要乱用，比如说多源的最短路，用Dijkstra求解的复杂度只有O(nmlog⁡m)O(nmlogm)，但太麻烦，如果数据范围允许，直接用Floyd就能在O(n3)O(n3)...]]></description><category></category></item><item><title><![CDATA[【算法笔记】多源最短路问题——Floyd算法]]></title><link>https://blog.csdn.net/write_1m_lines/article/details/126310381</link><guid>https://blog.csdn.net/write_1m_lines/article/details/126310381</guid><author>write_1m_lines</author><pubDate>Fri, 12 Aug 2022 21:07:11 +0800</pubDate><description><![CDATA[【算法笔记】多源最短路问题——Floyd算法
令$f(x,y)$为从顶点$x$到$y$的最短路径。初始时，有：...]]></description><category></category></item><item><title><![CDATA[【算法笔记】树形DP算法总结&详解]]></title><link>https://blog.csdn.net/write_1m_lines/article/details/126263935</link><guid>https://blog.csdn.net/write_1m_lines/article/details/126263935</guid><author>write_1m_lines</author><pubDate>Fri, 12 Aug 2022 10:15:12 +0800</pubDate><description><![CDATA[树形DP，又称树状DP，即在树上进行的DP，是DP（动态规划）算法中较为复杂的一种。本文将以例题+算法的形式，详细讲解这种算法。]]></description><category></category></item><item><title><![CDATA[LINE Verda Programming Contest (AtCoder Beginner Contest 263) A~E 题解]]></title><link>https://blog.csdn.net/write_1m_lines/article/details/126213374</link><guid>https://blog.csdn.net/write_1m_lines/article/details/126213374</guid><author>write_1m_lines</author><pubDate>Sun, 07 Aug 2022 19:45:16 +0800</pubDate><description><![CDATA[A - Full House
B - Ancestor
C - Monotonically Increasing
D - Left Right Operation
E - Sugoroku 3
F - Tournament
G - Erasing Prime Pairs
Ex - Intersection 2]]></description><category></category></item><item><title><![CDATA[PyQt6/PySide6：账本项目前端制作【附完整项目地址】]]></title><link>https://blog.csdn.net/write_1m_lines/article/details/125919223</link><guid>https://blog.csdn.net/write_1m_lines/article/details/125919223</guid><author>write_1m_lines</author><pubDate>Sat, 23 Jul 2022 08:00:00 +0800</pubDate><description><![CDATA[最近在家里闲着没事，正好又看到朋友@发了篇用Tkinter做的账本，于是决定跟他一起改进这个程序。本项目到此结束。【附项目地址】httpshttps记得点个Star哦~创作不易，若您喜欢这篇文章就请点个三连吧！万分感激！！！httpshttpshttpshttpshttpshttps。.........]]></description><category></category></item><item><title><![CDATA[AtCoder Beginner Contest 260 A~F 题解]]></title><link>https://blog.csdn.net/write_1m_lines/article/details/125878344</link><guid>https://blog.csdn.net/write_1m_lines/article/details/125878344</guid><author>write_1m_lines</author><pubDate>Tue, 19 Jul 2022 20:31:06 +0800</pubDate><description><![CDATA[A - A Unique Letter
B - Better Students Are Needed!
C - Changing Jewels
D - Draw Your Cards
E - At Least One
F - Find 4-cycle
G - Scalene Triangle Area
Ex - Colorfulness]]></description><category></category></item><item><title><![CDATA[AtCoder Beginner Contest 258 A~Ex 题解]]></title><link>https://blog.csdn.net/write_1m_lines/article/details/125582361</link><guid>https://blog.csdn.net/write_1m_lines/article/details/125582361</guid><author>write_1m_lines</author><pubDate>Mon, 04 Jul 2022 22:15:26 +0800</pubDate><description><![CDATA[ABC258 A~Ex 题解
A - When?
B - Number Box
C - Rotation
D - Trophy
E - Packing Potatoes
F - Main Street
G - Triangle
Ex - Odd Steps]]></description><category></category></item></channel></rss>