<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>最小覆盖子矩形 on 111qqz's blog</title><link>https://111qqz.com/en/tags/%E6%9C%80%E5%B0%8F%E8%A6%86%E7%9B%96%E5%AD%90%E7%9F%A9%E5%BD%A2/</link><description>Recent content in 最小覆盖子矩形 on 111qqz's blog</description><generator>Hugo -- gohugo.io</generator><language>en</language><copyright>© 2015-2026 111qqz</copyright><lastBuildDate>Wed, 10 Aug 2016 16:54:11 +0000</lastBuildDate><atom:link href="https://111qqz.com/en/tags/%E6%9C%80%E5%B0%8F%E8%A6%86%E7%9B%96%E5%AD%90%E7%9F%A9%E5%BD%A2/index.xml" rel="self" type="application/rss+xml"/><item><title>poj 2185 Milking Grid (最小覆盖子矩形，kmp)</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-08-10-poj-2185/</link><pubDate>Wed, 10 Aug 2016 16:54:11 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-08-10-poj-2185/</guid><description>&lt;p&gt;&lt;a href="http://poj.org/problem?id=2185" target="_blank" rel="noreferrer"&gt;poj 2185 题目链接&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;题意：给出一个字符矩形，问一个面积最小的矩形，覆盖掉整个矩形。大概就是二维的最小覆盖子串。&lt;/p&gt;</description></item></channel></rss>