<?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>LOJ &#8211; solstice23</title>
	<atom:link href="https://archive-blog.s23.moe/archives/tag/loj/feed" rel="self" type="application/rss+xml" />
	<link>https://archive-blog.s23.moe</link>
	<description>Blog</description>
	<lastBuildDate>Fri, 21 Aug 2020 16:49:26 +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>LOJ &#8211; solstice23</title>
	<link>https://archive-blog.s23.moe</link>
	<width>32</width>
	<height>32</height>
</image> 
	<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>网络流 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>【模板】二维树状数组 &#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>洛谷 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>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>
		<item>
		<title>LOJ 10170 -「一本通 5.4 例 1」骑士</title>
		<link>https://archive-blog.s23.moe/archives/251</link>
					<comments>https://archive-blog.s23.moe/archives/251#respond</comments>
		
		<dc:creator><![CDATA[solstice23]]></dc:creator>
		<pubDate>Wed, 27 Feb 2019 11:57:44 +0000</pubDate>
				<category><![CDATA[OI]]></category>
		<category><![CDATA[DP]]></category>
		<category><![CDATA[LOJ]]></category>
		<category><![CDATA[状压DP]]></category>
		<guid isPermaLink="false">http://abc233.site/?p=251</guid>

					<description><![CDATA[题面 题目传送门 在 $N*N$ 的棋盘上放 $K$ 个国王，国王可攻击相邻的 $8$ 个格子，求使它们无法互 [&#8230;]]]></description>
		
					<wfw:commentRss>https://archive-blog.s23.moe/archives/251/feed</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>洛谷 P1486 &#038; LOJ 10145 -「一本通 4.6 练习 2」郁闷的出纳员</title>
		<link>https://archive-blog.s23.moe/archives/140</link>
					<comments>https://archive-blog.s23.moe/archives/140#respond</comments>
		
		<dc:creator><![CDATA[solstice23]]></dc:creator>
		<pubDate>Sun, 17 Feb 2019 01:29:30 +0000</pubDate>
				<category><![CDATA[OI]]></category>
		<category><![CDATA[LOJ]]></category>
		<category><![CDATA[Treap]]></category>
		<category><![CDATA[平衡树]]></category>
		<category><![CDATA[洛谷]]></category>
		<guid isPermaLink="false">http://abc233.site/?p=140</guid>

					<description><![CDATA[题面 题目传送门 思路 看到题目的插入、删除和查询第 k 大操作，就想到了 Treap。 但是全部员工加减工资 [&#8230;]]]></description>
		
					<wfw:commentRss>https://archive-blog.s23.moe/archives/140/feed</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>洛谷 P2286 &#038; LOJ 10144 -「一本通 4.6 练习 1」宠物收养所</title>
		<link>https://archive-blog.s23.moe/archives/138</link>
					<comments>https://archive-blog.s23.moe/archives/138#respond</comments>
		
		<dc:creator><![CDATA[solstice23]]></dc:creator>
		<pubDate>Sun, 17 Feb 2019 01:19:29 +0000</pubDate>
				<category><![CDATA[OI]]></category>
		<category><![CDATA[LOJ]]></category>
		<category><![CDATA[Treap]]></category>
		<category><![CDATA[平衡树]]></category>
		<category><![CDATA[洛谷]]></category>
		<guid isPermaLink="false">http://abc233.site/?p=138</guid>

					<description><![CDATA[题面 题目传送门 思路 根据题意，每一个主人到达收养所后，如果有宠物，就会领养。同样地，宠物也是如此，只要有主 [&#8230;]]]></description>
		
					<wfw:commentRss>https://archive-blog.s23.moe/archives/138/feed</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>洛谷 CF776B &#038; LOJ 10201 -「一本通 6.2 练习 4」Sherlock and His Girlfriend</title>
		<link>https://archive-blog.s23.moe/archives/116</link>
					<comments>https://archive-blog.s23.moe/archives/116#respond</comments>
		
		<dc:creator><![CDATA[solstice23]]></dc:creator>
		<pubDate>Sat, 16 Feb 2019 01:16:53 +0000</pubDate>
				<category><![CDATA[OI]]></category>
		<category><![CDATA[CF]]></category>
		<category><![CDATA[LOJ]]></category>
		<category><![CDATA[数论]]></category>
		<category><![CDATA[洛谷]]></category>
		<category><![CDATA[素数]]></category>
		<guid isPermaLink="false">http://www.abc233.site/?p=116</guid>

					<description><![CDATA[题面 题目传送门 Sherlock 有了一个新女友（这太不像他了！）。情人节到了，他想送给女友一些珠宝当做礼物 [&#8230;]]]></description>
		
					<wfw:commentRss>https://archive-blog.s23.moe/archives/116/feed</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>LOJ 10138 -「一本通 4.5 例 1」树的统计</title>
		<link>https://archive-blog.s23.moe/archives/105</link>
					<comments>https://archive-blog.s23.moe/archives/105#respond</comments>
		
		<dc:creator><![CDATA[solstice23]]></dc:creator>
		<pubDate>Mon, 11 Feb 2019 15:54:39 +0000</pubDate>
				<category><![CDATA[OI]]></category>
		<category><![CDATA[LOJ]]></category>
		<category><![CDATA[树链剖分]]></category>
		<guid isPermaLink="false">http://www.abc233.site/?p=105</guid>

					<description><![CDATA[树链剖分模板题，详见这篇博客。]]></description>
		
					<wfw:commentRss>https://archive-blog.s23.moe/archives/105/feed</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>LOJ 10127 -「一本通 4.3 练习 1」最大数</title>
		<link>https://archive-blog.s23.moe/archives/98</link>
					<comments>https://archive-blog.s23.moe/archives/98#respond</comments>
		
		<dc:creator><![CDATA[solstice23]]></dc:creator>
		<pubDate>Fri, 01 Feb 2019 17:32:56 +0000</pubDate>
				<category><![CDATA[OI]]></category>
		<category><![CDATA[LOJ]]></category>
		<category><![CDATA[线段树]]></category>
		<guid isPermaLink="false">http://www.abc233.site/?p=98</guid>

					<description><![CDATA[题面 题目描述 给定一个正整数数列 $a_1, a_2, a_3, \dots , a_n$，每一个数都在 0 [&#8230;]]]></description>
		
					<wfw:commentRss>https://archive-blog.s23.moe/archives/98/feed</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>LOJ 10160 &#8211; 「一本通 5.2 练习 3」周年纪念晚会 / 没有上司的晚会</title>
		<link>https://archive-blog.s23.moe/archives/96</link>
					<comments>https://archive-blog.s23.moe/archives/96#respond</comments>
		
		<dc:creator><![CDATA[solstice23]]></dc:creator>
		<pubDate>Thu, 31 Jan 2019 16:21:43 +0000</pubDate>
				<category><![CDATA[OI]]></category>
		<category><![CDATA[LOJ]]></category>
		<category><![CDATA[树形DP]]></category>
		<guid isPermaLink="false">http://www.abc233.site/?p=96</guid>

					<description><![CDATA[题面 传送门 Ural 州立大学的校长正在筹备学校的 80 周年纪念聚会。由于学校的职员有不同的职务级别，可以 [&#8230;]]]></description>
		
					<wfw:commentRss>https://archive-blog.s23.moe/archives/96/feed</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
		<item>
		<title>LOJ 10155 &#8211; 「一本通 5.2 例 3」数字转换</title>
		<link>https://archive-blog.s23.moe/archives/94</link>
					<comments>https://archive-blog.s23.moe/archives/94#respond</comments>
		
		<dc:creator><![CDATA[solstice23]]></dc:creator>
		<pubDate>Thu, 31 Jan 2019 11:26:10 +0000</pubDate>
				<category><![CDATA[OI]]></category>
		<category><![CDATA[LOJ]]></category>
		<category><![CDATA[图论]]></category>
		<category><![CDATA[最长链]]></category>
		<guid isPermaLink="false">http://www.abc233.site/?p=94</guid>

					<description><![CDATA[题面 传送门 如果一个数 $x$ 的约数和 $y$ （不包括他本身）比他本身小，那么 $x$ 可以变成 $y$ [&#8230;]]]></description>
		
					<wfw:commentRss>https://archive-blog.s23.moe/archives/94/feed</wfw:commentRss>
			<slash:comments>0</slash:comments>
		
		
			</item>
	</channel>
</rss>
