zoukankan      html  css  js  c++  java
  • 【43.49】【LA 3026】Period

    For each prefix of a given string S with N characters (each character has an ASCII code between 97 and126, inclusive), we want to know whether the prefix is a periodic string. That is, for each i (2 ≤ i ≤ N)we want to know the largest K > 1 (if there is one) such that the prefix of S with length i can bewritten as AK, that is A concatenated K times, for some string A. Of course, we also want to knowthe period K.

    Input

    The input file consists of several test cases. Each test case consists of two lines. The first one containsN (2 ≤ N ≤ 1000000) the size of the string S. The second line contains the string S. The input fileends with a line, having the number zero on it.

    Output

    For each test case, output ‘Test case #’ and the consecutive test case number on a single line; then, foreach prefix with length i that has a period K > 1, output the prefix size i and the period K separatedby a single space; the prefix sizes must be in increasing order. Print a blank line after each test case.

    Sample Input

    3

    aaa

    12

    aabaabaabaab

    0

    Sample Output

    Test case #1

    2 2

    3 3


    Test case #2

    2 2

    6 2

    9 3

    12 4

    【题解】

    就是用KMP算法去做吧。感觉不是很好的题。有点怪怪的。

    记住这个结论就好i-f[i]是一个最长循环节的长度。

    UPD1

    找到了一个讲得比较好的博客:我是链接

    【代码】

    #include <cstdio>
    #include <cstring>
    
    const int MAX_SIZE = 1000100;
    
    int lose[MAX_SIZE],n;
    char s[MAX_SIZE];
    
    void input_data()
    {
    	scanf("%s", s);
    }
    
    void get_ans()
    {
    	lose[0] = 0;
    	lose[1] = 0;
    	for (int i = 1; i <= n - 1; i++)
    	{
    		int j = lose[i];
    		while (j && (s[i] != s[j])) j = lose[j];
    		lose[i + 1] = (s[i] == s[j] ? j + 1 : 0);
    	}
    }
    
    void output_ans()
    {
    	for (int i = 2; i <= n; i++)
    		if (lose[i] > 0 && i % (i - lose[i]) == 0)
    			printf("%d %d
    ", i, i / (i - lose[i]));
    	printf("
    ");
    }
    
    int main()
    {
    	//freopen("F:\rush.txt", "r", stdin);
    	int t = 0;
    	while (scanf("%d", &n) != EOF)
    	{
    		if (n == 0)
    			break;
    		t++;
    		printf("Test case #%d
    ",t);
    		input_data();
    		get_ans();
    		output_ans();
    	}
    	return 0;
    }


  • 相关阅读:
    P4014 分配问题(网络流24题 最大最小费用流)
    二分图多重匹配
    图论
    小于n的质数的个数(1≤n≤10^11)
    P2341 [HAOI2006]受欢迎的牛| 强连通分量 Tarjan 缩点
    数据库
    树状数组
    C++ 学习笔记
    网络原理
    CG 中点法画直线
  • 原文地址:https://www.cnblogs.com/AWCXV/p/7632244.html
Copyright © 2011-2022 走看看