<?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%A0%91%E5%A5%97%E6%A0%91/</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, 04 Sep 2016 13:47:07 +0000</lastBuildDate><atom:link href="https://111qqz.com/en/tags/%E6%A0%91%E5%A5%97%E6%A0%91/index.xml" rel="self" type="application/rss+xml"/><item><title>codeforces 19 D. Points (离散化+树套树（线段树+set）)</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-09-04-cf19d/</link><pubDate>Sun, 04 Sep 2016 13:47:07 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-09-04-cf19d/</guid><description>&lt;p&gt;&lt;a href="http://codeforces.com/problemset/problem/19/D" target="_blank" rel="noreferrer"&gt;题目链接&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;题意：&lt;/p&gt;
&lt;blockquote&gt;&lt;p&gt;在二维坐标平面内进行_n_ (1 ≤ &lt;em&gt;n&lt;/em&gt; ≤ 2·105) 次操作。一共有三种类型操作。&lt;/p&gt;</description></item></channel></rss>