﻿<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/"><channel><title>C++博客-Localhost 8080-最新评论</title><link>http://www.cppblog.com/superKiki/CommentsRSS.aspx</link><description>知行合一，自强不息</description><language>zh-cn</language><pubDate>Mon, 26 Jan 2015 16:18:13 GMT</pubDate><lastBuildDate>Mon, 26 Jan 2015 16:18:13 GMT</lastBuildDate><generator>cnblogs</generator><item><title>re: GCD,快速GCD，扩展GCD</title><link>http://www.cppblog.com/superKiki/archive/2013/11/06/116785.html#204116</link><dc:creator>请输入验证码</dc:creator><author>请输入验证码</author><pubDate>Wed, 06 Nov 2013 00:22:00 GMT</pubDate><guid>http://www.cppblog.com/superKiki/archive/2013/11/06/116785.html#204116</guid><description><![CDATA[在计算机编程中，模运算往往很慢。。。@kfrog<br><img src ="http://www.cppblog.com/superKiki/aggbug/204116.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/superKiki/" target="_blank">请输入验证码</a> 2013-11-06 08:22 <a href="http://www.cppblog.com/superKiki/archive/2013/11/06/116785.html#204116#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 计算空间中最近点对</title><link>http://www.cppblog.com/superKiki/archive/2012/05/23/128380.html#175918</link><dc:creator>shark_cf</dc:creator><author>shark_cf</author><pubDate>Wed, 23 May 2012 10:50:00 GMT</pubDate><guid>http://www.cppblog.com/superKiki/archive/2012/05/23/128380.html#175918</guid><description><![CDATA[&quot;假设有一个点q,坐标是xq, yq。可以证明在以q为………… &quot; 不知这一段在程序中那里体现出来了，还望大神指点迷津。<img src ="http://www.cppblog.com/superKiki/aggbug/175918.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/superKiki/" target="_blank">shark_cf</a> 2012-05-23 18:50 <a href="http://www.cppblog.com/superKiki/archive/2012/05/23/128380.html#175918#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 计算空间中最近点对[未登录]</title><link>http://www.cppblog.com/superKiki/archive/2011/09/04/128380.html#155070</link><dc:creator>.</dc:creator><author>.</author><pubDate>Sun, 04 Sep 2011 12:45:00 GMT</pubDate><guid>http://www.cppblog.com/superKiki/archive/2011/09/04/128380.html#155070</guid><description><![CDATA[吧<img src ="http://www.cppblog.com/superKiki/aggbug/155070.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/superKiki/" target="_blank">.</a> 2011-09-04 20:45 <a href="http://www.cppblog.com/superKiki/archive/2011/09/04/128380.html#155070#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 计算空间中最近点对[未登录]</title><link>http://www.cppblog.com/superKiki/archive/2011/09/04/128380.html#155069</link><dc:creator>.</dc:creator><author>.</author><pubDate>Sun, 04 Sep 2011 12:44:00 GMT</pubDate><guid>http://www.cppblog.com/superKiki/archive/2011/09/04/128380.html#155069</guid><description><![CDATA[如果用离散化后的y进行基数排序。。。可为nlogn。。。。。<br><img src ="http://www.cppblog.com/superKiki/aggbug/155069.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/superKiki/" target="_blank">.</a> 2011-09-04 20:44 <a href="http://www.cppblog.com/superKiki/archive/2011/09/04/128380.html#155069#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 计算空间中最近点对[未登录]</title><link>http://www.cppblog.com/superKiki/archive/2011/07/21/128380.html#151566</link><dc:creator>kerry</dc:creator><author>kerry</author><pubDate>Thu, 21 Jul 2011 11:40:00 GMT</pubDate><guid>http://www.cppblog.com/superKiki/archive/2011/07/21/128380.html#151566</guid><description><![CDATA[这个代码的精确复杂度应该是n(log(n)^2)吧？<img src ="http://www.cppblog.com/superKiki/aggbug/151566.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/superKiki/" target="_blank">kerry</a> 2011-07-21 19:40 <a href="http://www.cppblog.com/superKiki/archive/2011/07/21/128380.html#151566#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: GCD,快速GCD，扩展GCD</title><link>http://www.cppblog.com/superKiki/archive/2011/03/20/116785.html#142252</link><dc:creator>kfrog</dc:creator><author>kfrog</author><pubDate>Sun, 20 Mar 2011 00:25:00 GMT</pubDate><guid>http://www.cppblog.com/superKiki/archive/2011/03/20/116785.html#142252</guid><description><![CDATA[那个所谓的快速GCD应该不会比一般的GCD快吧？在求2个大整数的最大公约数时，用辗转相除显然比你用固定 除2收敛得快<img src ="http://www.cppblog.com/superKiki/aggbug/142252.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/superKiki/" target="_blank">kfrog</a> 2011-03-20 08:25 <a href="http://www.cppblog.com/superKiki/archive/2011/03/20/116785.html#142252#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>