POJ 1226 Substrings KMP-白红宇

POJ 1226 Substrings KMP

阅读量：6910 次

发布时间：2019-06-27

本文共 1223 字，大约阅读时间需要 4 分钟。

KMP.

暴力strstr也轻松过.

//#pragma comment(linker, "/STACK:1024000000,1024000000")#include
      
       #include
       
        #include
        
         #include
         
          #include
          
           #include
           
            #include
            
             #include
             
              #include
              
               #include
               #include
                
                 #include
                 
                  #include
                  
                   #include
                   
                    using namespace std;typedef long long ll;typedef pair
                    
                      pii;#define pb(a) push_back(a)#define INF 0x1f1f1f1f#define lson idx<<1,l,mid#define rson idx<<1|1,mid+1,r#define PI 3.1415926535898template
                     
                       T min(const T& a,const T& b,const T& c) { return min(min(a,b),min(a,c));}template
                      
                        T max(const T& a,const T& b,const T& c) { return max(max(a,b),max(a,c));}void debug() {#ifdef ONLINE_JUDGE#else freopen("d:\\in.txt","r",stdin); // freopen("d:\\out1.txt","w",stdout);#endif}int getch() { int ch; while((ch=getchar())!=EOF) { if(ch!=' '&&ch!='\n')return ch; } return EOF;}void GetNext(const char *s ,int *next){ int len=strlen(s); next[0]=next[1]=0; for(int i=2;i<=len;i++) { int j=next[i-1]; if(j&&s[j]!=s[i-1])j=next[j]; if(s[j]==s[i-1])next[i]=j+1; else next[i]=0; }}void reversal( char *s){ int len=strlen(s); for(int i=0,j=len-1;i