<?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/%E5%90%8C%E6%9E%84/</link><description>Recent content in 同构 on 111qqz's blog</description><generator>Hugo -- gohugo.io</generator><language>en</language><copyright>© 2015-2026 111qqz</copyright><lastBuildDate>Fri, 12 Aug 2016 08:37:06 +0000</lastBuildDate><atom:link href="https://111qqz.com/en/tags/%E5%90%8C%E6%9E%84/index.xml" rel="self" type="application/rss+xml"/><item><title>最小表示法学习笔记（同构问题+模板）</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-08-12-e69c80e5b08fe8a1a8e7a4bae6b395e5ada6e4b9a0e7ac94e8aeb0efbc88e5908ce69e84e997aee9a298efbc89/</link><pubDate>Fri, 12 Aug 2016 08:37:06 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-08-12-e69c80e5b08fe8a1a8e7a4bae6b395e5ada6e4b9a0e7ac94e8aeb0efbc88e5908ce69e84e997aee9a298efbc89/</guid><description>&lt;p&gt;首先放一波资料：&lt;/p&gt;
&lt;p&gt;&lt;a href="http://blog.csdn.net/cclsoft/article/details/5467743" target="_blank" rel="noreferrer"&gt;参考博客&lt;/a&gt;
对于字符串循环同构的最小表示法，&lt;strong&gt;其问题实质是求S串的一个位置&lt;/strong&gt;，从这个位置开始循环输出S，得到的S’字典序最小。&lt;/p&gt;</description></item></channel></rss>