CH1807 Necklace 字符串最小表示法

题目链接

http://noi-test.zzstep.com/contest/0x18%E3%80%8C%E5%9F%BA%E6%9C%AC%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E3%80%8D%E7%BB%83%E4%B9%A0/1807%20Necklace

分析

求循环同构字符串的最小表示，设两个指针跑，去除不必要的比较运算，复杂度为 $O(n)$。

AC代码

#include <cstdio>
#include <cstring>

const int maxl = 1e6 + 5;

char s1[2 * maxl], s2[2 * maxl];

inline int minp(char* s) {
	int n = strlen(s + 1);
	for (int i = 1; i <= n - 1; ++i) s[n + i] = s[i];
	int i = 1, j = 2;
	while (i <= n && j <= n) {
		int k = 0;
		while (s[i + k] == s[j + k] && k < n) ++k;
		if (k == n) return 0;
		if (s[i + k] > s[j + k]) {
			i += k + 1;
			if (i == j) ++i;
		}
		if (s[j + k] > s[i + k]) {
			j += k + 1;
			if (i == j) ++j;
		}
	}
	return i < j ? i : j;
}

int main() {
	scanf("%s%s", s1 + 1, s2 + 1);
	int n = strlen(s1 + 1);
	int a = minp(s1), b = minp(s2), flag = 1;
	for (int i = 0; i < n; ++i)
		if (s1[a + i] != s2[b + i]) flag = 0;
	if (!flag) printf("No");
	else {
		printf("Yes\n");
		for (int i = 0; i < n; ++i) putchar(s1[a + i]);
	}
	return 0;
}