<?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%9B%BC%E5%93%88%E9%A1%BF%E8%B7%9D%E7%A6%BB/</link><description>Recent content in 曼哈顿距离 on 111qqz's blog</description><generator>Hugo -- gohugo.io</generator><language>en</language><copyright>© 2015-2026 111qqz</copyright><lastBuildDate>Tue, 10 Oct 2017 06:49:55 +0000</lastBuildDate><atom:link href="https://111qqz.com/en/tags/%E6%9B%BC%E5%93%88%E9%A1%BF%E8%B7%9D%E7%A6%BB/index.xml" rel="self" type="application/rss+xml"/><item><title>BZOJ 2716: [Violet 3]天使玩偶 (动态kd-tree,带插入，曼哈顿距离模板题)</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-10-10-bzoj2716/</link><pubDate>Tue, 10 Oct 2017 06:49:55 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-10-10-bzoj2716/</guid><description>&lt;h2 class="relative group"&gt;&lt;a href="http://www.lydsy.com/JudgeOnline/problem.php?id=2716" target="_blank" rel="noreferrer"&gt;题目链接&lt;/a&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%e7%9b%ae%e9%93%be%e6%8e%a5" aria-label="Anchor"&gt;#&lt;/a&gt;
 &lt;/span&gt;
 
&lt;/h2&gt;

&lt;h2 class="relative group"&gt;Description
 &lt;div id="description" 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="#description" aria-label="Anchor"&gt;#&lt;/a&gt;
 &lt;/span&gt;
 
&lt;/h2&gt;
&lt;figure&gt;&lt;img
 class="my-0 rounded-md"
 loading="lazy"
 decoding="async"
 fetchpriority="low"
 alt=""
 src="http://www.lydsy.com/JudgeOnline/upload/201204/T3des%282%29.gif"
 &gt;&lt;/figure&gt;

&lt;h2 class="relative group"&gt;Input
 &lt;div id="input" 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="#input" aria-label="Anchor"&gt;#&lt;/a&gt;
 &lt;/span&gt;
 
&lt;/h2&gt;
&lt;figure&gt;&lt;img
 class="my-0 rounded-md"
 loading="lazy"
 decoding="async"
 fetchpriority="low"
 alt=""
 src="http://www.lydsy.com/JudgeOnline/upload/201204/T3input%282%29.gif"
 &gt;&lt;/figure&gt;

&lt;h2 class="relative group"&gt;Output
 &lt;div id="output" 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="#output" aria-label="Anchor"&gt;#&lt;/a&gt;
 &lt;/span&gt;
 
&lt;/h2&gt;
&lt;figure&gt;&lt;img
 class="my-0 rounded-md"
 loading="lazy"
 decoding="async"
 fetchpriority="low"
 alt=""
 src="http://www.lydsy.com/JudgeOnline/upload/201204/T3output%282%29.gif"
 &gt;&lt;/figure&gt;
&lt;p&gt;样例太长了，就不写了。&lt;/p&gt;</description></item><item><title>poj 2926 Requirements （五维曼哈顿距离变换【拆点】）</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-02-24-poj2926/</link><pubDate>Wed, 24 Feb 2016 16:43:52 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-02-24-poj2926/</guid><description>&lt;p&gt;&lt;a href="http://poj.org/problem?id=2926" target="_blank" rel="noreferrer"&gt;http://poj.org/problem?id=2926&lt;/a&gt;
题意：给出n(1E5)个五维空间内的坐标&amp;hellip;问最远的两个点距离多少。
思路：拆点即可。去绝对值。可以由二维空间推广到k维空间。一个点可以拆成2^(k-1)个点。 具体见代码。&lt;/p&gt;</description></item><item><title>hdu 5626 Clarke and points (曼哈顿距离变换，拆点)</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-02-24-hdu5626/</link><pubDate>Wed, 24 Feb 2016 15:56:56 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-02-24-hdu5626/</guid><description>&lt;p&gt;&lt;a href="http://acm.split.hdu.edu.cn/showproblem.php?pid=5626" target="_blank" rel="noreferrer"&gt;http://acm.split.hdu.edu.cn/showproblem.php?pid=5626&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;题意：给出n（1E6）个点的二维坐标，问距离最远的两个点的距离是多少。&lt;/p&gt;</description></item><item><title>bzoj 1604: [Usaco2008 Open]Cow Neighborhoods 奶牛的邻居 (曼哈顿距离的转化【拆点】+set+并查集)</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-02-24-bzoj1604/</link><pubDate>Wed, 24 Feb 2016 13:07:01 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-02-24-bzoj1604/</guid><description>&lt;p&gt;&lt;a href="http://www.lydsy.com/JudgeOnline/problem.php?id=1604" target="_blank" rel="noreferrer"&gt;http://www.lydsy.com/JudgeOnline/problem.php?id=1604&lt;/a&gt;
题意：了解奶牛们的人都知道，奶牛喜欢成群结队．观察约翰的N(1≤N≤100000)只奶牛，你会发现她们已经结成了几个“群”．每只奶牛在吃草的时候有一个独一无二的位置坐标Xi，Yi(l≤Xi，Yi≤[1．.10^9]；Xi，Yi∈整数．当满足下列两个条件之一，两只奶牛i和j是属于同一个群的：
1．两只奶牛的曼哈顿距离不超过C(1≤C≤10^9)，即lXi - xil+IYi - Yil≤C.
2．两只奶牛有共同的邻居．即，存在一只奶牛k，使i与k，j与k均同属一个群．
给出奶牛们的位置，请计算草原上有多少个牛群，以及最大的牛群里有多少奶牛&lt;/p&gt;</description></item></channel></rss>