<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Ssinon的博客]]></title><description><![CDATA[]]></description><link>https://blog.csdn.net/Ssinon</link><language>zh-cn</language><generator>https://blog.csdn.net/</generator><copyright><![CDATA[Copyright &copy; Ssinon]]></copyright><item><title><![CDATA[Codeforces 1646C Factorials and Powers of Two]]></title><link>https://blog.csdn.net/Ssinon/article/details/124110283</link><guid>https://blog.csdn.net/Ssinon/article/details/124110283</guid><author>Ssinon</author><pubDate>Mon, 11 Apr 2022 21:59:17 +0800</pubDate><description><![CDATA[cf 1646c Factorials and Powers of Two]]></description><category></category></item><item><title><![CDATA[P1351 [NOIP2014 提高组] 联合权值 洛谷]]></title><link>https://blog.csdn.net/Ssinon/article/details/123204918</link><guid>https://blog.csdn.net/Ssinon/article/details/123204918</guid><author>Ssinon</author><pubDate>Tue, 01 Mar 2022 14:57:00 +0800</pubDate><description><![CDATA[P1351 联合权值 洛谷]]></description><category></category></item><item><title><![CDATA[P1352 没有上司的舞会 洛谷树形DP]]></title><link>https://blog.csdn.net/Ssinon/article/details/123191088</link><guid>https://blog.csdn.net/Ssinon/article/details/123191088</guid><author>Ssinon</author><pubDate>Tue, 01 Mar 2022 08:37:34 +0800</pubDate><description><![CDATA[P1352 没有上司的舞会]]></description><category></category></item><item><title><![CDATA[LCA(最近公共祖先) 算法笔记]]></title><link>https://blog.csdn.net/Ssinon/article/details/123085587</link><guid>https://blog.csdn.net/Ssinon/article/details/123085587</guid><author>Ssinon</author><pubDate>Thu, 24 Feb 2022 09:23:22 +0800</pubDate><description><![CDATA[我们可以考虑这样一个问题，在一个确定根节点的树形结构中，如何求任意两个结点的最近公共祖先(Lowest Common Ancestor)。]]></description><category></category></item><item><title><![CDATA[Min酱要旅行 牛客DP入门]]></title><link>https://blog.csdn.net/Ssinon/article/details/123076290</link><guid>https://blog.csdn.net/Ssinon/article/details/123076290</guid><author>Ssinon</author><pubDate>Tue, 22 Feb 2022 20:52:50 +0800</pubDate><description><![CDATA[Min酱要旅行 牛客
01背包]]></description><category></category></item><item><title><![CDATA[[SCOI2009]粉刷匠 牛客DP入门]]></title><link>https://blog.csdn.net/Ssinon/article/details/122954244</link><guid>https://blog.csdn.net/Ssinon/article/details/122954244</guid><author>Ssinon</author><pubDate>Wed, 16 Feb 2022 14:18:44 +0800</pubDate><description><![CDATA[[SCOI2009]粉刷匠
线性DP、区间DP
题目描述：windy有 N 条木板需要被粉刷。 每条木板被分为 M 个格子。 ]]></description><category></category></item><item><title><![CDATA[牛客算法入门数学：1001-1006 质数]]></title><link>https://blog.csdn.net/Ssinon/article/details/122918170</link><guid>https://blog.csdn.net/Ssinon/article/details/122918170</guid><author>Ssinon</author><pubDate>Mon, 14 Feb 2022 15:59:47 +0800</pubDate><description><![CDATA[牛客素数判断,	素数回文,素数分布,	Forsaken喜欢数论,	漂亮数]]></description><category></category></item><item><title><![CDATA[牛客算法入门DP：「木」迷雾森林]]></title><link>https://blog.csdn.net/Ssinon/article/details/122899856</link><guid>https://blog.csdn.net/Ssinon/article/details/122899856</guid><author>Ssinon</author><pubDate>Sat, 12 Feb 2022 21:15:22 +0800</pubDate><description><![CDATA[过河卒的亲兄弟！]]></description><category></category></item><item><title><![CDATA[牛客算法入门DP：传球游戏]]></title><link>https://blog.csdn.net/Ssinon/article/details/122899000</link><guid>https://blog.csdn.net/Ssinon/article/details/122899000</guid><author>Ssinon</author><pubDate>Sat, 12 Feb 2022 17:53:22 +0800</pubDate><description><![CDATA[NOIP经典传球游戏]]></description><category></category></item><item><title><![CDATA[牛客算法入门DP：过河卒]]></title><link>https://blog.csdn.net/Ssinon/article/details/122897401</link><guid>https://blog.csdn.net/Ssinon/article/details/122897401</guid><author>Ssinon</author><pubDate>Sat, 12 Feb 2022 16:51:19 +0800</pubDate><description><![CDATA[过河卒,经典!

]]></description><category></category></item><item><title><![CDATA[算法入门DP：钉子和小球]]></title><link>https://blog.csdn.net/Ssinon/article/details/122891891</link><guid>https://blog.csdn.net/Ssinon/article/details/122891891</guid><author>Ssinon</author><pubDate>Sat, 12 Feb 2022 15:35:57 +0800</pubDate><description><![CDATA[牛客入门DP：钉子和小球]]></description><category></category></item><item><title><![CDATA[算法入门DP-免费馅饼]]></title><link>https://blog.csdn.net/Ssinon/article/details/122887998</link><guid>https://blog.csdn.net/Ssinon/article/details/122887998</guid><author>Ssinon</author><pubDate>Fri, 11 Feb 2022 23:41:21 +0800</pubDate><description><![CDATA[0x00 题目来源
1006-免费馅饼
0x10 Tag
线性DP
0x20 题目描述

SERKOI最新推出了一种叫做“免费馅饼”的游戏:游戏在一个舞台上进行。舞台的宽度为WWW格，天幕的高度为HHH格，游戏者占一格。开始时游戏者站在舞台的正中央，手里拿着一个托盘。下图为天幕的高度为4格时某一个时刻游戏者接馅饼的情景]]></description><category></category></item></channel></rss>