<?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/%E5%8C%BA%E9%97%B4%E5%90%88%E5%B9%B6/</link><description>Recent content in 区间合并 on 111qqz's blog</description><generator>Hugo -- gohugo.io</generator><language>en</language><copyright>© 2015-2026 111qqz</copyright><lastBuildDate>Fri, 23 Sep 2016 10:38:51 +0000</lastBuildDate><atom:link href="https://111qqz.com/en/tags/%E5%8C%BA%E9%97%B4%E5%90%88%E5%B9%B6/index.xml" rel="self" type="application/rss+xml"/><item><title>codeforces 380 C. Sereja and Brackets (线段树区间合并)</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-09-23-cf380c/</link><pubDate>Fri, 23 Sep 2016 10:38:51 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-09-23-cf380c/</guid><description>&lt;p&gt;&lt;a href="http://codeforces.com/problemset/problem/380/C" target="_blank" rel="noreferrer"&gt;题目链接&lt;/a&gt;
题意：给出一个由‘(’和‘）’组成的字符串。。。然后给出若干查询。。。每个查询一个区间，问区间中能匹配的括号数。。。&lt;/p&gt;</description></item></channel></rss>