#include <cstdio>
#include <cstring>
#define N 1000001

char str[N], substr[N];

int main()
{
    char *p, *strend;
    int len, ppos;
    int period, count;
	int test = 0;
    while(scanf("%d", &len), len != 0)
    {
		scanf("%s", str);
		printf("Test case #%d\n", ++test);
		ppos = 0;
		p = str;
		strend = str + len;
		while(p < strend)
		{
		    period = p - str + 1;
		    while(ppos < period)
            {
                substr[ppos] = str[ppos];
                ++ppos;
                p = str + period;
            }
            substr[ppos] = '\0';
            count = 1;
            while(strncmp(p, substr, period) == 0)
            {
                ++count;
                p += period;
                printf("%d %d\n", int(p - str), count);
            }
		}
        printf("\n");
    }
    return 0;
}

• Re:一样的算法, 2406(141ms), 1961(tle), 就多个输出, 这么费时么, 我的算法应该是O(n)呀!求大神给看看! (943) 455952523 2011-05-19 14:13:46
• Re:一样的算法, 2406(141ms), 1961(tle), 就多个输出, 这么费时么, 我的算法应该是O(n)呀!求大神给看看! (18) 596380446 2017-12-23 20:10:14