<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[hangbai233的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/hangbai233</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; hangbai233]]></copyright><item><title><![CDATA[单调队列 AcWing 154. 滑动窗口]]></title><link>https://blog.youkuaiyun.com/hangbai233/article/details/132524529</link><guid>https://blog.youkuaiyun.com/hangbai233/article/details/132524529</guid><author>hangbai233</author><pubDate>Sun, 27 Aug 2023 16:38:16 +0800</pubDate><description><![CDATA[AcWing 154. 滑动窗口。]]></description><category></category></item><item><title><![CDATA[单调栈 AcWing 830. 单调栈]]></title><link>https://blog.youkuaiyun.com/hangbai233/article/details/132523957</link><guid>https://blog.youkuaiyun.com/hangbai233/article/details/132523957</guid><author>hangbai233</author><pubDate>Sun, 27 Aug 2023 16:02:40 +0800</pubDate><description><![CDATA[给定一个长度为 N 的整数数列，输出每个数左边第一个比它小的数，如果不存在则输出 −1。输入格式第一行包含整数 N，表示数列长度。第二行包含 N 个整数，表示整数数列。输出格式共一行，包含 N 个整数，其中第 i 个数表示第 i 个数的左边第一个比它小的数，如果不存在则输出 −1。]]></description><category></category></item><item><title><![CDATA[离散化 AcWing 802. 区间和]]></title><link>https://blog.youkuaiyun.com/hangbai233/article/details/132423539</link><guid>https://blog.youkuaiyun.com/hangbai233/article/details/132423539</guid><author>hangbai233</author><pubDate>Wed, 23 Aug 2023 17:50:56 +0800</pubDate><description><![CDATA[上面的以后慢慢补。]]></description><category></category></item><item><title><![CDATA[《算法通关村第一关——链表青铜挑战笔记》]]></title><link>https://blog.youkuaiyun.com/hangbai233/article/details/131750346</link><guid>https://blog.youkuaiyun.com/hangbai233/article/details/131750346</guid><author>hangbai233</author><pubDate>Mon, 17 Jul 2023 13:42:41 +0800</pubDate><description><![CDATA[学习笔记]]></description><category></category></item></channel></rss>