<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[leaprun的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/leaprun</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; leaprun]]></copyright><item><title><![CDATA[软件工程-软件工程导论-复习提纲]]></title><link>https://blog.youkuaiyun.com/leaprun/article/details/140087104</link><guid>https://blog.youkuaiyun.com/leaprun/article/details/140087104</guid><author>leaprun</author><pubDate>Sun, 30 Jun 2024 23:15:18 +0800</pubDate><description><![CDATA[四川大学-软件工程专业-软件工程导论-复习提纲及笔记]]></description><category></category></item><item><title><![CDATA[例1.4 Max sum (hdu 1003)]]></title><link>https://blog.youkuaiyun.com/leaprun/article/details/139301664</link><guid>https://blog.youkuaiyun.com/leaprun/article/details/139301664</guid><author>leaprun</author><pubDate>Wed, 29 May 2024 17:31:30 +0800</pubDate><description><![CDATA[【代码】例1.4 Max sum (hdu 1003)]]></description><category></category></item><item><title><![CDATA[洛谷 P1886 滑动窗口 /【模板】单调队列]]></title><link>https://blog.youkuaiyun.com/leaprun/article/details/139299606</link><guid>https://blog.youkuaiyun.com/leaprun/article/details/139299606</guid><author>leaprun</author><pubDate>Wed, 29 May 2024 16:34:54 +0800</pubDate><description><![CDATA[【代码】洛谷 P1886 滑动窗口 /【模板】单调队列。]]></description><category></category></item><item><title><![CDATA[洛谷P1160 队列安排--c++ STL]]></title><link>https://blog.youkuaiyun.com/leaprun/article/details/139220155</link><guid>https://blog.youkuaiyun.com/leaprun/article/details/139220155</guid><author>leaprun</author><pubDate>Sun, 26 May 2024 20:38:46 +0800</pubDate><description><![CDATA[【代码】洛谷P1160 队列安排。]]></description><category></category></item><item><title><![CDATA[队列--洛谷P1540]]></title><link>https://blog.youkuaiyun.com/leaprun/article/details/137202613</link><guid>https://blog.youkuaiyun.com/leaprun/article/details/137202613</guid><author>leaprun</author><pubDate>Sun, 31 Mar 2024 16:10:34 +0800</pubDate><description><![CDATA[【代码】队列--洛谷P1540。]]></description><category></category></item><item><title><![CDATA[动态链表实现约瑟夫问题]]></title><link>https://blog.youkuaiyun.com/leaprun/article/details/137201383</link><guid>https://blog.youkuaiyun.com/leaprun/article/details/137201383</guid><author>leaprun</author><pubDate>Sun, 31 Mar 2024 15:25:38 +0800</pubDate><description><![CDATA[约瑟夫问题：n 个人围成一圈，从第一个人开始报数,数到 m 的人出列，再由下一个人重新从 11 开始报数，数到 m 的人再出圈，依次类推，直到所有的人都出圈，请输出依次出圈人的编号。]]></description><category></category></item></channel></rss>