<?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/%E4%B8%89%E5%88%86/</link><description>Recent content in 三分 on 111qqz's blog</description><generator>Hugo -- gohugo.io</generator><language>en</language><copyright>© 2015-2026 111qqz</copyright><lastBuildDate>Sat, 14 Oct 2017 16:54:24 +0000</lastBuildDate><atom:link href="https://111qqz.com/en/tags/%E4%B8%89%E5%88%86/index.xml" rel="self" type="application/rss+xml"/><item><title>poj 3301 Texas Trip (三分，模板题)</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-10-14-poj-3301/</link><pubDate>Sat, 14 Oct 2017 16:54:24 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-10-14-poj-3301/</guid><description>&lt;p&gt;&lt;a href="http://poj.org/problem?id=3301" 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个点，要求一个面积最小的正方形，使其能覆盖所有的点。&lt;/p&gt;</description></item><item><title>hdu 5531 | 2015 ICPC 长春 regional onsite Rebuild (三分)</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-10-14-hdu-5531/</link><pubDate>Sat, 14 Oct 2017 15:55:31 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-10-14-hdu-5531/</guid><description>&lt;p&gt;&lt;a href="http://acm.split.hdu.edu.cn/showproblem.php?pid=5531" 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个点，表示n个圆的圆心，问一组圆的半径，满足相邻(i,i+1)或者(n,1) 圆相&lt;strong&gt;外切&lt;/strong&gt;。&lt;/p&gt;</description></item></channel></rss>