<?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/%E7%9F%A9%E5%BD%A2%E9%9D%A2%E7%A7%AF%E4%BA%A4/</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, 27 Sep 2017 13:20:23 +0000</lastBuildDate><atom:link href="https://111qqz.com/en/tags/%E7%9F%A9%E5%BD%A2%E9%9D%A2%E7%A7%AF%E4%BA%A4/index.xml" rel="self" type="application/rss+xml"/><item><title>hdu 1255 覆盖的面积 (扫描线+线段树 求矩形面积交)</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-09-27-hdu1255/</link><pubDate>Wed, 27 Sep 2017 13:20:23 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-09-27-hdu1255/</guid><description>&lt;p&gt;&lt;a href="http://acm.hdu.edu.cn/showproblem.php?pid=1255" target="_blank" rel="noreferrer"&gt;题目链接&lt;/a&gt;&lt;/p&gt;

&lt;h1 class="relative group"&gt;题意：
 &lt;div id="题意" class="anchor"&gt;&lt;/div&gt;
 
 &lt;span
 class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"&gt;
 &lt;a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#%e9%a2%98%e6%84%8f" aria-label="Anchor"&gt;#&lt;/a&gt;
 &lt;/span&gt;
 
&lt;/h1&gt;
&lt;p&gt;求n（1000）个矩形的面积交，也就&lt;strong&gt;是至少有2个矩形覆盖的区域的面积&lt;/strong&gt;。&lt;/p&gt;</description></item></channel></rss>