<?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%8B%AC%E5%8F%B7%E5%8C%B9%E9%85%8D/</link><description>Recent content in 括号匹配 on 111qqz's blog</description><generator>Hugo -- gohugo.io</generator><language>en</language><copyright>© 2015-2026 111qqz</copyright><lastBuildDate>Sun, 07 Aug 2016 17:29:31 +0000</lastBuildDate><atom:link href="https://111qqz.com/en/tags/%E6%8B%AC%E5%8F%B7%E5%8C%B9%E9%85%8D/index.xml" rel="self" type="application/rss+xml"/><item><title>whust 2016 #1 H - Pair: normal and paranormal</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-08-07-whust-2016-1-h-pair-normal-and-paranormal/</link><pubDate>Sun, 07 Aug 2016 17:29:31 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-08-07-whust-2016-1-h-pair-normal-and-paranormal/</guid><description>&lt;p&gt;&lt;a href="http://codeforces.com/gym/100507/attachments" target="_blank" rel="noreferrer"&gt;题目链接&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;其实就是括号匹配的模型。。用栈即可。。被我写挂好几发。。该死该死。。。&lt;/p&gt;</description></item><item><title>poj 1141 Brackets Sequence (区间dp,括号匹配，记录路径)</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-07-25-poj-1141/</link><pubDate>Mon, 25 Jul 2016 08:29:03 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-07-25-poj-1141/</guid><description>&lt;p&gt;&lt;a href="http://poj.org/problem?id=1141" target="_blank" rel="noreferrer"&gt;poj 1141题目链接&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;题意：给出一个括号序列，要求添加最少的括号，使得这个序列变成合法的括号匹配，输出最后的序列。&lt;/p&gt;</description></item></channel></rss>