专题训练一：字符串

最新推荐文章于 2024-10-30 16:47:45 发布

独行侠x

最新推荐文章于 2024-10-30 16:47:45 发布

阅读量54

点赞数

分类专栏： acm 专题训练一文章标签： KMP算法 next数组字符串处理循环节 C++

本文链接：https://blog.csdn.net/no_c_no_python/article/details/117427082

版权

acm 专题训练一专栏收录该内容

2 篇文章 0 订阅

订阅专栏

#acm 专题训练一：字符串
##求最小循环节（next 数组）
kmp算法的一种学习路径b站 [添加链接描述]
kmp算法
知乎大佬
(https://www.bilibili.com/video/av11866460/?from=search&seid=5799786832388382283)

next数组

void getnex(char *s,int nex[])
{
	int len = strlen(s);
	int i = 0,j = -1;
	nex[0] = -1;
	while(i < len)
	{
		if(j == -1 || s[i] == s[j])
		{
			i++;
			j++;
			nex[i] = j;
		}
		else
			j = nex[j]; 
	}
}

循环节有几位 next数组就有几个0

例题：
A—Power Strings
Given two strings a and b we define ab to be their concatenation. For example, if a = “abc” and b = “def” then ab = “abcdef”. If we think of concatenation as multiplication, exponentiation by a non-negative integer is defined in the normal way: a^0 = “” (the empty string) and a^(n+1) = a*(a^n).
Input
Each test case is a line of input representing s, a string of printable characters. The length of s will be at least 1 and will not exceed 1 million characters. A line containing a period follows the last test case.
Output
For each s you should print the largest n such that s = a^n for some string a.
Sample Input
abcd
aaaa
ababab
.
Sample Output
1
4
3

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<algorithm>
#include<cstring>
#include <typeinfo>
#define ll long long
#define MAXS 30
const int N=5*1e5+10;
using namespace std;

char s[1000005];
int ne[1000005];

void getnext(char *a)
{
	int len = strlen(a);
	int i = 0, j = -1;
	ne[0] = -1;
	while(i < len)
	{
		if(j == -1 || a[i] == a[j])
		{	
			ne[++i] = ++j;
		}
		else j = ne[j];
	}
}
int main ()
{
	while(scanf("%s",s) && s[0] != '.')
	{
		getnext(s); 
		int l=strlen(s);
//		cout << l << endl;
//		for(int i=0; i<l ;i++ )
//		{
//			cout << ne[i] << " " ;
//		}
//		cout << endl; 
//		cout << ne[l] << endl;

		if(l % (l - ne[l]) ==0)
			printf("%d\n",l/(l-ne[l]));
		else
			printf("1\n");
	}
	return 0;
}