<?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%A8%A1%E6%8B%9F%E9%80%80%E7%81%AB/</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, 31 Aug 2016 13:32:02 +0000</lastBuildDate><atom:link href="https://111qqz.com/en/tags/%E6%A8%A1%E6%8B%9F%E9%80%80%E7%81%AB/index.xml" rel="self" type="application/rss+xml"/><item><title>BZOJ 3680: 吊打XXX (广义费马点，模拟退火+爬山)</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-08-31-bzoj-3680-e5908ae68993xxx-e5b9bfe4b989e8b4b9e9a9ace782b9efbc8ce6a8a1e68b9fe98080e781abe788ace5b1b1/</link><pubDate>Wed, 31 Aug 2016 13:32:02 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-08-31-bzoj-3680-e5908ae68993xxx-e5b9bfe4b989e8b4b9e9a9ace782b9efbc8ce6a8a1e68b9fe98080e781abe788ace5b1b1/</guid><description>&lt;h2 class="relative group"&gt;3680: 吊打XXX
 &lt;div id="3680-吊打xxx" 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="#3680-%e5%90%8a%e6%89%93xxx" aria-label="Anchor"&gt;#&lt;/a&gt;
 &lt;/span&gt;
 
&lt;/h2&gt;
&lt;p&gt;Time Limit: 10 Sec  Memory Limit: 128 MBSec  Special Judge
Submit: 2043  Solved: 732
[&lt;a href="http://www.lydsy.com/JudgeOnline/submitpage.php?id=3680" target="_blank" rel="noreferrer"&gt;Submit&lt;/a&gt;][&lt;a href="http://www.lydsy.com/JudgeOnline/problemstatus.php?id=3680" target="_blank" rel="noreferrer"&gt;Status&lt;/a&gt;][&lt;a href="http://www.lydsy.com/JudgeOnline/bbs.php?id=3680" target="_blank" rel="noreferrer"&gt;Discuss&lt;/a&gt;]&lt;/p&gt;</description></item><item><title>hdu 5017 Ellipsoid (模拟退火，计算椭球到定点的最小距离)</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-08-31-hdu-5017-ellipsoid-e6a8a1e68b9fe98080e781abefbc8ce8aea1e7ae97e6a4ade79083e588b0e5ae9ae782b9e79a84e69c80e5b08fe8b79de7a6bb/</link><pubDate>Wed, 31 Aug 2016 06:51:29 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-08-31-hdu-5017-ellipsoid-e6a8a1e68b9fe98080e781abefbc8ce8aea1e7ae97e6a4ade79083e588b0e5ae9ae782b9e79a84e69c80e5b08fe8b79de7a6bb/</guid><description>&lt;p&gt;&lt;a href="http://acm.split.hdu.edu.cn/showproblem.php?pid=5017" target="_blank" rel="noreferrer"&gt;hdu 5017 题目链接&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;题意：给出椭球方程的6的参数 a,b,c,d,e,f &lt;figure&gt;&lt;img
 class="my-0 rounded-md"
 loading="lazy"
 decoding="async"
 fetchpriority="low"
 alt=""
 src="http://acm.split.hdu.edu.cn/data/images/C534-1011-1.jpg"
 &gt;&lt;/figure&gt;
&lt;/p&gt;
&lt;p&gt;问椭球上的点到原点(0,0,,0)的最小距离是多少。&lt;/p&gt;</description></item><item><title>poj 2069 Super Star (模拟退火)</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-08-30-poj-2069/</link><pubDate>Tue, 30 Aug 2016 12:12:29 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-08-30-poj-2069/</guid><description>&lt;p&gt;&lt;a href="http://poj.org/problem?id=2069" target="_blank" rel="noreferrer"&gt;poj 2069 题目链接&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;题意：给出n个点，找出包含这n个点的最小半径的外接球。求球的半径。&lt;/p&gt;</description></item><item><title>poj 2420 A Star not a Tree? (模拟退火模板题求多边形费马点)</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-08-29-poj-2420/</link><pubDate>Mon, 29 Aug 2016 03:23:27 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-08-29-poj-2420/</guid><description>&lt;p&gt;&lt;a href="http://poj.org/problem?id=2420" target="_blank" rel="noreferrer"&gt;poj 2420&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;题意：求多边形费马点，也就是距离所有点的距离之和最小的点。&lt;/p&gt;</description></item><item><title>poj 1379 Run Away (模拟退火)</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-08-28-poj-1379/</link><pubDate>Sun, 28 Aug 2016 11:49:57 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-08-28-poj-1379/</guid><description>&lt;p&gt;&lt;a href="http://poj.org/problem?id=1379" target="_blank" rel="noreferrer"&gt;poj 1379题目链接&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;题意：给出一个矩形区域的长宽，给出区域中若干点，问距离所有点的最近距离的最大值是多少。&lt;/p&gt;</description></item></channel></rss>