zoukankan      html  css  js  c++  java
  • HDU 1358 KMP

    #include <cstdio>
    #include <cstdlib>
    #include <cstring>
    #include <cmath>
    #include <cctype>
    #include <vector>
    #include <stack>
    #include <queue>
    #include <map>
    #include <algorithm>
    #include <iostream>
    #include <string>
    #include <set>
    #define X first
    #define Y second
    #define sqr(x) (x)*(x)
    #pragma comment(linker,"/STACK:102400000,102400000")
    using namespace std;
    const double PI = acos(-1.0);
    map<int, int>::iterator it;
    typedef long long LL ;
    template<typename T> void checkmin(T &x, T y) {x = min(x, y);}
    template<typename T> void checkmax(T &x, T y) {x = max(x, y);}
    
    const int N = 1000005;
    int p[N];
    int KMP(char *a, int n, char *b, int m) {
        p[0] = -1;
        int i, j = -1;
        for(i = 1; i <= m; i++) {
            while((j > -1) && (b[j+1] != b[i]))
                j = p[j];
            if(b[j+1] == b[i]) j++;
            p[i] = j;
        }
        //for(i=0;i<m;i++) printf("%d   ",p[i]); printf("
    ");
        j = -1;
        for(i = 0; i < n; i++) {
            while((j > -1) && (b[j+1] != a[i])) j = p[j];
            if(b[j+1] == a[i]) {
                j++;
            }
            if(j == m - 1) {
                //printf("i=%d
    ",i);
                //return i-m+1;
                j = p[j];
            }
        }
        return -1;
    }
    char s[N];
    
    int main() {
        int n;
        int T = 0;
        while(~scanf("%d", &n), n) {
            scanf("%s", s);
            KMP(s,n,s,n);
            printf("Test case #%d
    ",++T);
            for(int i=0;i<n;++i)
            {
                int len = i - p[i];
                if( (i+1)%len==0&&(i+1)/len>=2 )
                {
                    printf("%d %d
    ",i+1,(i+1)/len);
                }
            }
            puts("");
            /*
            for(int i = 0; i < n; ++i) {
                printf("%3c", s[i]);
            } puts("");
            for(int i = 0; i < n; ++i) {
                printf("%3d", p[i]);
            } puts("");
            */
        }
        return 0;
    }
  • 相关阅读:
    实验四 Android开发基础
    20135322实验五实验报告
    Eclipse中Ant的配置与测试
    实验三 敏捷开发与XP实践
    实验二 Java面向对象程序设计
    Java实验报告一:Java开发环境的熟悉
    简单四则运算
    个人介绍
    团队冲刺第一阶段个人工作总结2
    团队冲刺第一阶段个人工作总结1
  • 原文地址:https://www.cnblogs.com/cxw199204/p/3348497.html
Copyright © 2011-2022 走看看