KMP (next update array of understanding) Codeforces Round # 578 (Div 2.) - Compress Words

Topic links: https://codeforc.es/contest/1200/problem/E

Meaning of the questions:

There are n string string, you can not even make up: sample please ease in out --- "sampleaseinout

Ideas:

KMP ah sure, but when the game is on the next array kmp little knowledge, so I do not know how to use.

next to key string array is actually processed next (mismatch value), then match up the letter string.

  1 #define IOS ios_base::sync_with_stdio(0); cin.tie(0);
  2 #include <cstdio>//sprintf islower isupper
  3 #include <cstdlib>//malloc  exit strcat itoa system("cls")
  4 #include <iostream>//pair
  5 #include <fstream>
  6 #include <bitset>
  7 //#include <map>
  8 //#include<unordered_map>    https://codeforc.es/contest/1200/problem/E
  9 #include <vector>
 10 #include <stack>
 11 #include <set>
 12 #include <string.h>//strstr substr
 13 #include <string>
 14 #include <time.h>//srand(((unsigned)time(NULL))); Seed n=rand()%10 - 0~9;
 15 #include <cmath>
 16 #include <deque>
 17 #include <queue>//priority_queue<int, vector<int>, greater<int> > q;//less
 18 #include <vector>//emplace_back
 19 //#include <math.h>
 20 //#include <windows.h>//reverse(a,a+len);// ~ ! ~ ! floor
 21 #include <algorithm>//sort + unique : sz=unique(b+1,b+n+1)-(b+1);+nth_element(first, nth, last, compare)
 22 using namespace std;//next_permutation(a+1,a+1+n);//prev_permutation
 23 #define fo(a,b,c) for(register int a=b;a<=c;++a)
 24 #define fr(a,b,c) for(register int a=b;a>=c;--a)
 25 #define mem(a,b) memset(a,b,sizeof(a))
 26 #define pr printf
 27 #define sc scanf
 28 #define ls rt<<1
 29 #define rs rt<<1|1
 30 void swapp(int &a,int &b);
 31 double fabss(double a);
 32 int maxx(int a,int b);
 33 int minn(int a,int b);
 34 int Del_bit_1(int n);
 35 int lowbit(int n);
 36 int abss(int a);
 37 //const long long INF=(1LL<<60);
 38 const double E=2.718281828;
 39 const double PI=acos(-1.0);
 40 const int inf=(1<<29);
 41 const double ESP=1e-9;
 42 const int mod=(int)1e9+7;
 43 const int N=(int)1e7+10;
 44 
 45 int nxt[N],tlen,klen;
 46 char key[N],txt[N];
 47 
 48 void getNext()
 49 {
 50     int j,k;
 51     j=0;
 52     k=-1;
 53     nxt[0]=-1;
 54     while(j<klen)
 55     {
 56         if(k==-1||key[j]==key[k])
 57         {
 58             nxt[++j]=++k;
 59             if(key[j]!=key[k])//优化
 60                 nxt[j]=k;
 61         }
 62         else
63 is              K = NXT [K];
 64      }
 65  }
 66  
67  int KMP ()
 68  {
 69      int i = max (TLEN-Klen, 0 ), J = 0 ; // here since i is the maximum length of the matching longitudinal Operator Therefore, the opening paragraph just behind the key length from the line; 
70      getNext ();
 71 is      the while (I <TLEN) // at the end of the letter string ended; 
72      {
 73 is          IF (J == - . 1 || TXT [I ] == Key [J])
 74          {
 75              I ++ ;
 76              J ++ ;
77          }
 78          the else 
79              j = NXT [j];
 80      }
 81      return j; // out j i is the maximum time to the end of the match length; 
82  }
 83  
84  int main ()
 85  {
 86      int n-;
 87      SC ( " % D " , & n-);
 88      SC ( " % S " , TXT);
 89      TLEN = strlen (TXT);
 90      FO (I, 2 , n-)
 91 is      {
 92         sc("%s",key);
 93         klen=strlen(key);
 94         int pos=kmp();
 95         fo(j,pos,klen-1)
 96             txt[tlen++]=key[j];
 97     }
 98     txt[tlen]='\0';
 99     pr("%s\n",txt);
100     return 0;
101 }
102 
103 /**************************************************************************************/
104 
105 int maxx(int a,int b)
106 {
107     return a>b?a:b;
108 }
109 
110 void swapp(int &a,int &b)
111 {
112     a^=b^=a^=b;
113 }
114 
115 int lowbit(int n)
116 {
117     return n&(-n);
118 }
119 
120 int Del_bit_1(int n)
121 {
122     return n&(n-1);
123 }
124 
125 int abss(int a)
126 {
127     return a>0?a:-a;
128 }
129 
130 double fabss(double a)
131 {
132     return a>0?a:-a;
133 }
134 
135 int minn(int a,int b)
136 {
137     return a<b?a:b;
138 }