<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>OI &#8211; solstice23</title>
	<atom:link href="https://archive-blog.s23.moe/archives/category/oi/feed" rel="self" type="application/rss+xml" />
	<link>https://archive-blog.s23.moe</link>
	<description>Blog</description>
	<lastBuildDate>Wed, 07 Oct 2020 06:39:28 +0000</lastBuildDate>
	<language>zh-CN</language>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=6.2.3</generator>

<image>
	<url>https://archive-blog.s23.moe/wp-content/uploads/2020/03/cropped-solstice23icon-32x32.png</url>
	<title>OI &#8211; solstice23</title>
	<link>https://archive-blog.s23.moe</link>
	<width>32</width>
	<height>32</height>
</image> 
	<item>
		<title>暴力数据结构 : 珂朵莉树 (ODT)</title>
		<link>https://archive-blog.s23.moe/archives/1518</link>
					<comments>https://archive-blog.s23.moe/archives/1518#comments</comments>
		
		<dc:creator><![CDATA[solstice23]]></dc:creator>
		<pubDate>Thu, 11 Jun 2020 10:11:38 +0000</pubDate>
				<category><![CDATA[OI]]></category>
		<category><![CDATA[模板]]></category>
		<category><![CDATA[珂朵莉树]]></category>
		<category><![CDATA[算法]]></category>
		<guid isPermaLink="false">https://archive-blog.s23.moe/?p=1518</guid>

					<description><![CDATA[前言 珂朵莉树Old Driver Tree (ODT) 是一种十分暴力的数据结构。珂朵莉树是一场 CF 比赛 [&#8230;]]]></description>
		
					<wfw:commentRss>https://archive-blog.s23.moe/archives/1518/feed</wfw:commentRss>
			<slash:comments>8</slash:comments>
		
		
			</item>
		<item>
		<title>[NOI Online 3 提高组] 魔法值 题解</title>
		<link>https://archive-blog.s23.moe/archives/1481</link>
					<comments>https://archive-blog.s23.moe/archives/1481#comments</comments>
		
		<dc:creator><![CDATA[solstice23]]></dc:creator>
		<pubDate>Mon, 25 May 2020 09:34:18 +0000</pubDate>
				<category><![CDATA[OI]]></category>
		<category><![CDATA[NOI Online]]></category>
		<category><![CDATA[矩阵优化]]></category>
		<guid isPermaLink="false">https://archive-blog.s23.moe/?p=1481</guid>

					<description><![CDATA[前言 好题，考的时候用循环节做法水了部分分。看上去是图论实际上是矩阵乘(yi)法(huo)。 题面 H 国的交 [&#8230;]]]></description>
		
					<wfw:commentRss>https://archive-blog.s23.moe/archives/1481/feed</wfw:commentRss>
			<slash:comments>8</slash:comments>
		
		
			</item>
		<item>
		<title>BZOJ #4070 [Apio2015]雅加达的摩天楼</title>
		<link>https://archive-blog.s23.moe/archives/1457</link>
					<comments>https://archive-blog.s23.moe/archives/1457#comments</comments>
		
		<dc:creator><![CDATA[solstice23]]></dc:creator>
		<pubDate>Mon, 18 May 2020 12:53:26 +0000</pubDate>
				<category><![CDATA[OI]]></category>
		<category><![CDATA[BZOJ]]></category>
		<category><![CDATA[建图]]></category>
		<category><![CDATA[最短路]]></category>
		<guid isPermaLink="false">https://archive-blog.s23.moe/?p=1457</guid>

					<description><![CDATA[Description 印尼首都雅加达市有 $N$ 座摩天楼，它们排列成一条直线，我们从左到右依次将它们编号为 [&#8230;]]]></description>
		
					<wfw:commentRss>https://archive-blog.s23.moe/archives/1457/feed</wfw:commentRss>
			<slash:comments>5</slash:comments>
		
		
			</item>
		<item>
		<title>BZOJ #2700 聚会 &#038; #4269 再见 Xor &#038; #4247 挂饰 &#038; #4576 [Usaco2016 Open]262144 &#038; #2460 [BeiJing2011]元素 &#038; #3039 玉蟾宫 &#038; #4543 [POI2014]Hotel 加强版 &#038; #2396 神奇的矩阵 &#038; #1213 [HNOI2004]高精度开根</title>
		<link>https://archive-blog.s23.moe/archives/1417</link>
					<comments>https://archive-blog.s23.moe/archives/1417#comments</comments>
		
		<dc:creator><![CDATA[solstice23]]></dc:creator>
		<pubDate>Wed, 13 May 2020 13:54:12 +0000</pubDate>
				<category><![CDATA[OI]]></category>
		<category><![CDATA[DP]]></category>
		<category><![CDATA[区间DP]]></category>
		<category><![CDATA[启发式合并]]></category>
		<category><![CDATA[数论]]></category>
		<category><![CDATA[树形DP]]></category>
		<category><![CDATA[矩阵]]></category>
		<category><![CDATA[线性基]]></category>
		<category><![CDATA[贪心]]></category>
		<category><![CDATA[长链剖分]]></category>
		<category><![CDATA[随机化]]></category>
		<category><![CDATA[高精度]]></category>
		<guid isPermaLink="false">https://archive-blog.s23.moe/?p=1417</guid>

					<description><![CDATA[#2700 聚会 Description Alice 正在组织一次有 $M$ 位同学参加的同学聚会。Alice [&#8230;]]]></description>
		
					<wfw:commentRss>https://archive-blog.s23.moe/archives/1417/feed</wfw:commentRss>
			<slash:comments>3</slash:comments>
		
		
			</item>
		<item>
		<title>BZOJ #1999 [Noip2007]Core 树网的核 &#038; #2936 [Poi1999]降 水 &#038; #1907 树的路径覆盖 &#038; #1270 [BeijingWc2008]雷涛的小猫</title>
		<link>https://archive-blog.s23.moe/archives/1374</link>
					<comments>https://archive-blog.s23.moe/archives/1374#comments</comments>
		
		<dc:creator><![CDATA[solstice23]]></dc:creator>
		<pubDate>Tue, 12 May 2020 11:59:49 +0000</pubDate>
				<category><![CDATA[OI]]></category>
		<category><![CDATA[BFS]]></category>
		<category><![CDATA[BZOJ]]></category>
		<category><![CDATA[DFS]]></category>
		<category><![CDATA[DP]]></category>
		<category><![CDATA[图论]]></category>
		<category><![CDATA[贪心]]></category>
		<guid isPermaLink="false">https://archive-blog.s23.moe/?p=1374</guid>

					<description><![CDATA[BZOJ #1999 [Noip2007]Core 树网的核 Description 设 $T=(V, E,  [&#8230;]]]></description>
		
					<wfw:commentRss>https://archive-blog.s23.moe/archives/1374/feed</wfw:commentRss>
			<slash:comments>5</slash:comments>
		
		
			</item>
		<item>
		<title>[ZJOI2010]网络扩容</title>
		<link>https://archive-blog.s23.moe/archives/1020</link>
					<comments>https://archive-blog.s23.moe/archives/1020#respond</comments>
		
		<dc:creator><![CDATA[solstice23]]></dc:creator>
		<pubDate>Mon, 20 Jan 2020 03:22:04 +0000</pubDate>
				<category><![CDATA[OI]]></category>
		<category><![CDATA[省选]]></category>
		<category><![CDATA[网络流]]></category>
		<category><![CDATA[费用流]]></category>
		<guid isPermaLink="false">https://abc233.site/?p=1020</guid>

					<description><![CDATA[题面 给定一张有向图，每条边都有一个容量 $C$ 和一个扩容费用 $W$。这里扩容费用是指将容量扩大 $1$  [&#8230;]]]></description>
		
					<wfw:commentRss>https://archive-blog.s23.moe/archives/1020/feed</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>[SDOI2009]晨跑</title>
		<link>https://archive-blog.s23.moe/archives/1017</link>
					<comments>https://archive-blog.s23.moe/archives/1017#comments</comments>
		
		<dc:creator><![CDATA[solstice23]]></dc:creator>
		<pubDate>Mon, 20 Jan 2020 01:55:35 +0000</pubDate>
				<category><![CDATA[OI]]></category>
		<category><![CDATA[省选]]></category>
		<category><![CDATA[网络流]]></category>
		<category><![CDATA[费用流]]></category>
		<guid isPermaLink="false">https://abc233.site/?p=1017</guid>

					<description><![CDATA[题目描述 题目大意：给出一张点数为 $n$，边数为 $m$ 的有向图，除了点 $1$ 和点 $n$ 外每个点和 [&#8230;]]]></description>
		
					<wfw:commentRss>https://archive-blog.s23.moe/archives/1017/feed</wfw:commentRss>
			<slash:comments>2</slash:comments>
		
		
			</item>
		<item>
		<title>网络流 24 题 &#8211; 分配问题</title>
		<link>https://archive-blog.s23.moe/archives/987</link>
					<comments>https://archive-blog.s23.moe/archives/987#respond</comments>
		
		<dc:creator><![CDATA[solstice23]]></dc:creator>
		<pubDate>Mon, 16 Dec 2019 11:52:55 +0000</pubDate>
				<category><![CDATA[OI]]></category>
		<category><![CDATA[LOJ]]></category>
		<category><![CDATA[二分图]]></category>
		<category><![CDATA[洛谷]]></category>
		<category><![CDATA[网络流]]></category>
		<category><![CDATA[网络流 24 题]]></category>
		<category><![CDATA[费用流]]></category>
		<guid isPermaLink="false">https://abc233.site/?p=987</guid>

					<description><![CDATA[题面 题目传送 题目描述 有 $ n $ 件工作要分配给 $ n $ 个人做。第 $ i $ 个人做第 $ j [&#8230;]]]></description>
		
					<wfw:commentRss>https://archive-blog.s23.moe/archives/987/feed</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>网络流 24 题 &#8211; 负载平衡问题</title>
		<link>https://archive-blog.s23.moe/archives/980</link>
					<comments>https://archive-blog.s23.moe/archives/980#comments</comments>
		
		<dc:creator><![CDATA[solstice23]]></dc:creator>
		<pubDate>Mon, 16 Dec 2019 11:10:45 +0000</pubDate>
				<category><![CDATA[OI]]></category>
		<category><![CDATA[LOJ]]></category>
		<category><![CDATA[洛谷]]></category>
		<category><![CDATA[网络流]]></category>
		<category><![CDATA[网络流 24 题]]></category>
		<category><![CDATA[费用流]]></category>
		<guid isPermaLink="false">https://abc233.site/?p=980</guid>

					<description><![CDATA[题面 题目传送 题目描述 $G$ 公司有 $n$ 个沿铁路运输线环形排列的仓库，每个仓库存储的货物数量不等。如 [&#8230;]]]></description>
		
					<wfw:commentRss>https://archive-blog.s23.moe/archives/980/feed</wfw:commentRss>
			<slash:comments>1</slash:comments>
		
		
			</item>
		<item>
		<title>P2774 方格取数问题</title>
		<link>https://archive-blog.s23.moe/archives/976</link>
					<comments>https://archive-blog.s23.moe/archives/976#respond</comments>
		
		<dc:creator><![CDATA[solstice23]]></dc:creator>
		<pubDate>Sun, 08 Dec 2019 12:11:51 +0000</pubDate>
				<category><![CDATA[OI]]></category>
		<category><![CDATA[最小割]]></category>
		<category><![CDATA[洛谷]]></category>
		<category><![CDATA[网络流]]></category>
		<guid isPermaLink="false">https://abc233.site/?p=976</guid>

					<description><![CDATA[题面 洛谷 P2774 题目描述 在一个有 $m*n$ 个方格的棋盘中，每个方格中有一个正整数。现要从方格中取 [&#8230;]]]></description>
		
					<wfw:commentRss>https://archive-blog.s23.moe/archives/976/feed</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>[ZJOI2009]狼和羊的故事</title>
		<link>https://archive-blog.s23.moe/archives/970</link>
					<comments>https://archive-blog.s23.moe/archives/970#respond</comments>
		
		<dc:creator><![CDATA[solstice23]]></dc:creator>
		<pubDate>Sun, 08 Dec 2019 10:19:03 +0000</pubDate>
				<category><![CDATA[OI]]></category>
		<category><![CDATA[最大流]]></category>
		<category><![CDATA[洛谷]]></category>
		<category><![CDATA[省选]]></category>
		<category><![CDATA[网络流]]></category>
		<guid isPermaLink="false">https://abc233.site/?p=970</guid>

					<description><![CDATA[题面 描述 洛谷 P2598 狼爱上羊啊爱的疯狂，谁让他们真爱了一场； 狼爱上羊啊并不荒唐，他们说有爱就有方向 [&#8230;]]]></description>
		
					<wfw:commentRss>https://archive-blog.s23.moe/archives/970/feed</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>网络流 24 题 &#8211; 试题库问题</title>
		<link>https://archive-blog.s23.moe/archives/965</link>
					<comments>https://archive-blog.s23.moe/archives/965#respond</comments>
		
		<dc:creator><![CDATA[solstice23]]></dc:creator>
		<pubDate>Sun, 08 Dec 2019 07:39:33 +0000</pubDate>
				<category><![CDATA[OI]]></category>
		<category><![CDATA[LOJ]]></category>
		<category><![CDATA[最大流]]></category>
		<category><![CDATA[洛谷]]></category>
		<category><![CDATA[网络流]]></category>
		<category><![CDATA[网络流 24 题]]></category>
		<guid isPermaLink="false">https://abc233.site/?p=965</guid>

					<description><![CDATA[题面 洛谷 P2763 &#38; LOJ #6006 题目描述 假设一个试题库中有 $ n $ 道试题。每道 [&#8230;]]]></description>
		
					<wfw:commentRss>https://archive-blog.s23.moe/archives/965/feed</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>[SCOI2007] 蜥蜴</title>
		<link>https://archive-blog.s23.moe/archives/961</link>
					<comments>https://archive-blog.s23.moe/archives/961#respond</comments>
		
		<dc:creator><![CDATA[solstice23]]></dc:creator>
		<pubDate>Sun, 01 Dec 2019 14:10:32 +0000</pubDate>
				<category><![CDATA[OI]]></category>
		<category><![CDATA[最大流]]></category>
		<category><![CDATA[洛谷]]></category>
		<category><![CDATA[省选]]></category>
		<category><![CDATA[网络流]]></category>
		<guid isPermaLink="false">https://abc233.site/?p=961</guid>

					<description><![CDATA[题面 在一个 r 行 c 列的网格地图中有一些高度不同的石柱，一些石柱上站着一些蜥蜴，你的任务是让尽量多的蜥蜴 [&#8230;]]]></description>
		
					<wfw:commentRss>https://archive-blog.s23.moe/archives/961/feed</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>洛谷 P2764 最小路径覆盖问题</title>
		<link>https://archive-blog.s23.moe/archives/954</link>
					<comments>https://archive-blog.s23.moe/archives/954#respond</comments>
		
		<dc:creator><![CDATA[solstice23]]></dc:creator>
		<pubDate>Thu, 28 Nov 2019 14:31:59 +0000</pubDate>
				<category><![CDATA[OI]]></category>
		<category><![CDATA[二分图]]></category>
		<category><![CDATA[洛谷]]></category>
		<category><![CDATA[网络流]]></category>
		<category><![CDATA[网络流 24 题]]></category>
		<guid isPermaLink="false">https://abc233.site/?p=954</guid>

					<description><![CDATA[题面 题目传送 给定有向图 $G=(V,E)$ 。设 $P$ 是 $G$ 的一个简单路(顶点不相交)的集合。如 [&#8230;]]]></description>
		
					<wfw:commentRss>https://archive-blog.s23.moe/archives/954/feed</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>密码保护：校内 OJ 20191113 模拟赛</title>
		<link>https://archive-blog.s23.moe/archives/940</link>
					<comments>https://archive-blog.s23.moe/archives/940#respond</comments>
		
		<dc:creator><![CDATA[solstice23]]></dc:creator>
		<pubDate>Wed, 13 Nov 2019 07:51:27 +0000</pubDate>
				<category><![CDATA[OI]]></category>
		<category><![CDATA[DP]]></category>
		<category><![CDATA[二分图]]></category>
		<category><![CDATA[斜率优化]]></category>
		<guid isPermaLink="false">https://abc233.site/?p=940</guid>

					<description><![CDATA[无法提供摘要。这是一篇受保护的文章。]]></description>
		
					<wfw:commentRss>https://archive-blog.s23.moe/archives/940/feed</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>AT2702 Fountain Walk</title>
		<link>https://archive-blog.s23.moe/archives/935</link>
					<comments>https://archive-blog.s23.moe/archives/935#respond</comments>
		
		<dc:creator><![CDATA[solstice23]]></dc:creator>
		<pubDate>Tue, 12 Nov 2019 11:39:09 +0000</pubDate>
				<category><![CDATA[OI]]></category>
		<category><![CDATA[DP]]></category>
		<guid isPermaLink="false">https://abc233.site/?p=935</guid>

					<description><![CDATA[前言 校内模拟考试的其中一题，细节很多，测的时候 WA 了几个点，后来才改对 题面 题目链接 (luogu.o [&#8230;]]]></description>
		
					<wfw:commentRss>https://archive-blog.s23.moe/archives/935/feed</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>密码保护：NOIP 初赛笔记</title>
		<link>https://archive-blog.s23.moe/archives/829</link>
					<comments>https://archive-blog.s23.moe/archives/829#respond</comments>
		
		<dc:creator><![CDATA[solstice23]]></dc:creator>
		<pubDate>Wed, 09 Oct 2019 10:46:32 +0000</pubDate>
				<category><![CDATA[OI]]></category>
		<guid isPermaLink="false">https://abc233.site/?p=829</guid>

					<description><![CDATA[无法提供摘要。这是一篇受保护的文章。]]></description>
		
					<wfw:commentRss>https://archive-blog.s23.moe/archives/829/feed</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>2019.9.15 校内模拟赛</title>
		<link>https://archive-blog.s23.moe/archives/797</link>
					<comments>https://archive-blog.s23.moe/archives/797#comments</comments>
		
		<dc:creator><![CDATA[solstice23]]></dc:creator>
		<pubDate>Sun, 15 Sep 2019 12:11:27 +0000</pubDate>
				<category><![CDATA[OI]]></category>
		<category><![CDATA[DP]]></category>
		<category><![CDATA[数学]]></category>
		<category><![CDATA[模拟赛]]></category>
		<guid isPermaLink="false">https://abc233.site/?p=797</guid>

					<description><![CDATA[前言 分数不算高，100 + 37 + 0，但为什么就排到靠前了？？ T1 &#8211; Snakes 原题 [&#8230;]]]></description>
		
					<wfw:commentRss>https://archive-blog.s23.moe/archives/797/feed</wfw:commentRss>
			<slash:comments>2</slash:comments>
		
		
			</item>
		<item>
		<title>[SDOI2015]排序 ( 洛谷 P3322 &#038; BZOJ 3990 )</title>
		<link>https://archive-blog.s23.moe/archives/640</link>
					<comments>https://archive-blog.s23.moe/archives/640#respond</comments>
		
		<dc:creator><![CDATA[solstice23]]></dc:creator>
		<pubDate>Mon, 08 Jul 2019 04:43:33 +0000</pubDate>
				<category><![CDATA[OI]]></category>
		<category><![CDATA[BZOJ]]></category>
		<category><![CDATA[DFS]]></category>
		<category><![CDATA[搜索]]></category>
		<category><![CDATA[洛谷]]></category>
		<category><![CDATA[省选]]></category>
		<guid isPermaLink="false">https://abc233.site/?p=640</guid>

					<description><![CDATA[题面 题目描述 小A有一个 $1-2^N$ 的排列 $A[1..2^N]$ ,他希望将 $A$ 数组从小到大排 [&#8230;]]]></description>
		
					<wfw:commentRss>https://archive-blog.s23.moe/archives/640/feed</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>校内 OJ 2019.5.19 模拟赛</title>
		<link>https://archive-blog.s23.moe/archives/561</link>
					<comments>https://archive-blog.s23.moe/archives/561#respond</comments>
		
		<dc:creator><![CDATA[solstice23]]></dc:creator>
		<pubDate>Sun, 19 May 2019 08:15:45 +0000</pubDate>
				<category><![CDATA[OI]]></category>
		<category><![CDATA[DP]]></category>
		<category><![CDATA[树形DP]]></category>
		<category><![CDATA[线段树]]></category>
		<category><![CDATA[贪心]]></category>
		<category><![CDATA[高斯消元]]></category>
		<guid isPermaLink="false">https://abc233.site/?p=561</guid>

					<description><![CDATA[前言 Rank 5，$130$ 分，第二题因为懒就没怎么打，第三题用玄学拿(pian)到了 $20$ 分。 P [&#8230;]]]></description>
		
					<wfw:commentRss>https://archive-blog.s23.moe/archives/561/feed</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>【模板】二维树状数组 &#038; LOJ #133 二维树状数组 1</title>
		<link>https://archive-blog.s23.moe/archives/553</link>
					<comments>https://archive-blog.s23.moe/archives/553#respond</comments>
		
		<dc:creator><![CDATA[solstice23]]></dc:creator>
		<pubDate>Fri, 17 May 2019 17:08:12 +0000</pubDate>
				<category><![CDATA[OI]]></category>
		<category><![CDATA[LOJ]]></category>
		<category><![CDATA[二维树状数组]]></category>
		<category><![CDATA[容斥]]></category>
		<category><![CDATA[树状数组]]></category>
		<category><![CDATA[模板]]></category>
		<guid isPermaLink="false">https://abc233.site/?p=553</guid>

					<description><![CDATA[题面 题目链接 这是一道模板题。 给出一个  的零矩阵 ，你需要完成如下操作： 1 x y k：表示元素  自 [&#8230;]]]></description>
		
					<wfw:commentRss>https://archive-blog.s23.moe/archives/553/feed</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>密码保护：校内 OJ &#8211; 2019.5.12 下午模拟赛</title>
		<link>https://archive-blog.s23.moe/archives/535</link>
					<comments>https://archive-blog.s23.moe/archives/535#respond</comments>
		
		<dc:creator><![CDATA[solstice23]]></dc:creator>
		<pubDate>Mon, 13 May 2019 13:28:22 +0000</pubDate>
				<category><![CDATA[OI]]></category>
		<category><![CDATA[DFS]]></category>
		<category><![CDATA[尺取]]></category>
		<category><![CDATA[搜索]]></category>
		<category><![CDATA[数学]]></category>
		<category><![CDATA[模拟]]></category>
		<category><![CDATA[模拟赛]]></category>
		<category><![CDATA[解题报告]]></category>
		<category><![CDATA[贪心]]></category>
		<guid isPermaLink="false">https://abc233.site/?p=535</guid>

					<description><![CDATA[无法提供摘要。这是一篇受保护的文章。]]></description>
		
					<wfw:commentRss>https://archive-blog.s23.moe/archives/535/feed</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>校内 OJ &#8211; 2019.5.12 上午模拟赛</title>
		<link>https://archive-blog.s23.moe/archives/531</link>
					<comments>https://archive-blog.s23.moe/archives/531#respond</comments>
		
		<dc:creator><![CDATA[solstice23]]></dc:creator>
		<pubDate>Sun, 12 May 2019 14:31:17 +0000</pubDate>
				<category><![CDATA[OI]]></category>
		<category><![CDATA[DFS]]></category>
		<category><![CDATA[搜索]]></category>
		<category><![CDATA[模拟]]></category>
		<category><![CDATA[模拟赛]]></category>
		<category><![CDATA[解题报告]]></category>
		<guid isPermaLink="false">https://abc233.site/?p=531</guid>

					<description><![CDATA[前言 思维难度不大，$190/300$ 分，$Rank 2$ ，$Rating +96$ 。 题目 P1 &# [&#8230;]]]></description>
		
					<wfw:commentRss>https://archive-blog.s23.moe/archives/531/feed</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>校内OJ 2019.4.14 NOIP 模拟赛</title>
		<link>https://archive-blog.s23.moe/archives/492</link>
					<comments>https://archive-blog.s23.moe/archives/492#comments</comments>
		
		<dc:creator><![CDATA[solstice23]]></dc:creator>
		<pubDate>Sun, 14 Apr 2019 05:45:19 +0000</pubDate>
				<category><![CDATA[OI]]></category>
		<category><![CDATA[DP]]></category>
		<category><![CDATA[图论]]></category>
		<category><![CDATA[数学]]></category>
		<category><![CDATA[模拟赛]]></category>
		<category><![CDATA[欧拉筛]]></category>
		<category><![CDATA[解题报告]]></category>
		<guid isPermaLink="false">https://abc233.site/?p=492</guid>

					<description><![CDATA[前言 一些话 炸了，细节有很多没处理好。 题目有些不明显，丢了很多不该丢的分。 P1 质因数 题面 有一个正整 [&#8230;]]]></description>
		
					<wfw:commentRss>https://archive-blog.s23.moe/archives/492/feed</wfw:commentRss>
			<slash:comments>1</slash:comments>
		
		
			</item>
		<item>
		<title>洛谷 P2756 飞行员配对方案问题 &#038; LOJ #6000「网络流 24 题」搭配飞行员</title>
		<link>https://archive-blog.s23.moe/archives/459</link>
					<comments>https://archive-blog.s23.moe/archives/459#respond</comments>
		
		<dc:creator><![CDATA[solstice23]]></dc:creator>
		<pubDate>Wed, 03 Apr 2019 11:37:01 +0000</pubDate>
				<category><![CDATA[OI]]></category>
		<category><![CDATA[LOJ]]></category>
		<category><![CDATA[二分图]]></category>
		<category><![CDATA[最大流]]></category>
		<category><![CDATA[洛谷]]></category>
		<category><![CDATA[网络流]]></category>
		<category><![CDATA[网络流 24 题]]></category>
		<guid isPermaLink="false">https://abc233.site/?p=459</guid>

					<description><![CDATA[题面 洛谷 P2756 飞行员配对方案问题 LOJ #6000.「网络流 24 题」搭配飞行员 因为 LOJ  [&#8230;]]]></description>
		
					<wfw:commentRss>https://archive-blog.s23.moe/archives/459/feed</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>校内OJ 2019.3.17 NOIP 模拟赛</title>
		<link>https://archive-blog.s23.moe/archives/444</link>
					<comments>https://archive-blog.s23.moe/archives/444#comments</comments>
		
		<dc:creator><![CDATA[solstice23]]></dc:creator>
		<pubDate>Sun, 31 Mar 2019 07:09:35 +0000</pubDate>
				<category><![CDATA[OI]]></category>
		<category><![CDATA[DP]]></category>
		<category><![CDATA[模拟]]></category>
		<category><![CDATA[模拟赛]]></category>
		<category><![CDATA[解题报告]]></category>
		<category><![CDATA[贪心]]></category>
		<guid isPermaLink="false">https://abc233.site/?p=444</guid>

					<description><![CDATA[前言 Rank 7，Rating +48。 第二道题 $STL$ 莫名玄学炸 T 掉 40 分。 P1 电阻  [&#8230;]]]></description>
		
					<wfw:commentRss>https://archive-blog.s23.moe/archives/444/feed</wfw:commentRss>
			<slash:comments>1</slash:comments>
		
		
			</item>
		<item>
		<title>网络流 EK (Edmond-Karp) 算法详解 求解最大流和费用流问题</title>
		<link>https://archive-blog.s23.moe/archives/428</link>
					<comments>https://archive-blog.s23.moe/archives/428#respond</comments>
		
		<dc:creator><![CDATA[solstice23]]></dc:creator>
		<pubDate>Thu, 28 Mar 2019 16:21:43 +0000</pubDate>
				<category><![CDATA[OI]]></category>
		<category><![CDATA[EK算法]]></category>
		<category><![CDATA[最大流]]></category>
		<category><![CDATA[模板]]></category>
		<category><![CDATA[网络流]]></category>
		<category><![CDATA[费用流]]></category>
		<guid isPermaLink="false">https://abc233.site/?p=428</guid>

					<description><![CDATA[前言 问题 有 $n$ 个城市，$m$ 条单向铁路连接了这些城市。每条铁路可以售 $s_i$ 张票。现在人们要 [&#8230;]]]></description>
		
					<wfw:commentRss>https://archive-blog.s23.moe/archives/428/feed</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>校内OJ 2019.3.17 NOIP 模拟赛</title>
		<link>https://archive-blog.s23.moe/archives/380</link>
					<comments>https://archive-blog.s23.moe/archives/380#respond</comments>
		
		<dc:creator><![CDATA[solstice23]]></dc:creator>
		<pubDate>Sun, 17 Mar 2019 06:36:36 +0000</pubDate>
				<category><![CDATA[OI]]></category>
		<category><![CDATA[数学]]></category>
		<category><![CDATA[期望]]></category>
		<category><![CDATA[枚举]]></category>
		<category><![CDATA[模拟赛]]></category>
		<category><![CDATA[解题报告]]></category>
		<category><![CDATA[贪心]]></category>
		<guid isPermaLink="false">https://abc233.site/?p=380</guid>

					<description><![CDATA[前言 Rk 3，Rating 涨了，这次前两道题比较简单，最后一题比较毒瘤。 P1 身体训练 原题出自 LOJ [&#8230;]]]></description>
		
					<wfw:commentRss>https://archive-blog.s23.moe/archives/380/feed</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>校内OJ 2019.3.10 NOIP 模拟赛</title>
		<link>https://archive-blog.s23.moe/archives/335</link>
					<comments>https://archive-blog.s23.moe/archives/335#respond</comments>
		
		<dc:creator><![CDATA[solstice23]]></dc:creator>
		<pubDate>Wed, 13 Mar 2019 10:07:15 +0000</pubDate>
				<category><![CDATA[OI]]></category>
		<category><![CDATA[哈夫曼树]]></category>
		<category><![CDATA[模拟赛]]></category>
		<category><![CDATA[离散化]]></category>
		<category><![CDATA[线段树]]></category>
		<category><![CDATA[解题报告]]></category>
		<category><![CDATA[贪心]]></category>
		<category><![CDATA[高精度]]></category>
		<guid isPermaLink="false">https://abc233.site/?p=335</guid>

					<description><![CDATA[Rating 上了一点，考试时本来可以多得五十分的。。 P1  A^B Problem 题面 给出 $A$ 和 [&#8230;]]]></description>
		
					<wfw:commentRss>https://archive-blog.s23.moe/archives/335/feed</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>LOJ 10176 -「一本通 5.5 例 2」最大连续和</title>
		<link>https://archive-blog.s23.moe/archives/299</link>
					<comments>https://archive-blog.s23.moe/archives/299#respond</comments>
		
		<dc:creator><![CDATA[solstice23]]></dc:creator>
		<pubDate>Wed, 06 Mar 2019 10:50:33 +0000</pubDate>
				<category><![CDATA[OI]]></category>
		<category><![CDATA[DP]]></category>
		<category><![CDATA[LOJ]]></category>
		<category><![CDATA[单调队列]]></category>
		<guid isPermaLink="false">http://abc233.site/?p=299</guid>

					<description><![CDATA[题面 题目传送 给你一个长度为 $n$ 的整数序列 ${a_1,a_2,\dots,a_n}$ ，要求从中找出 [&#8230;]]]></description>
		
					<wfw:commentRss>https://archive-blog.s23.moe/archives/299/feed</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
	</channel>
</rss>
