題意非常難懂：

大概是給你一個密碼表，一個劫獲的串。那個劫獲的串的前一部分是密文後一部分是明文，但是不清楚分界線在哪裡。讓你把這個串補完，並使長度盡量小。。。

思路：把劫獲的串整個翻譯成密碼串作為文本串T，原來串P作為模板串做EXKMP，從中間位置開始枚舉，如果在位置i上的ex[ i ]等於i到結尾的距離，分界線就在這了。。。

Clairewd’s message

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2954 Accepted Submission(s): 1137


Problem Description Clairewd is a member of FBI. After several years concealing in BUPT, she intercepted some important messages and she was preparing for sending it to ykwd. They had agreed that each letter of these messages would be transfered to another one according to a conversion table.
Unfortunately, GFW(someone's name, not what you just think about) has detected their action. He also got their conversion table by some unknown methods before. Clairewd was so clever and vigilant that when she realized that somebody was monitoring their action, she just stopped transmitting messages.
But GFW knows that Clairewd would always firstly send the ciphertext and then plaintext(Note that they won't overlap each other). But he doesn't know how to separate the text because he has no idea about the whole message. However, he thinks that recovering the shortest possible text is not a hard task for you.
Now GFW will give you the intercepted text and the conversion table. You should help him work out this problem.

Input The first line contains only one integer T, which is the number of test cases.
Each test case contains two lines. The first line of each test case is the conversion table S. S[i] is the ith latin letter's cryptographic letter. The second line is the intercepted text which has n letters that you should recover. It is possible that the text is complete.
Hint Range of test data:
T<= 100 ;
n<= 100000;

Output For each test case, output one line contains the shorest possible complete text.
Sample Input

2
abcdefghijklmnopqrstuvwxyz
abcdab
qwertyuiopasdfghjklzxcvbnm
qwertabcde

Sample Output

abcdabcd
qwertabcde

Author BUPT
Source 2012 Multi-University Training Contest 1

#include 
#include 
#include 
#include 

using namespace std;

const int maxn=110000;

char T[maxn],P[maxn],table[maxn],Table[maxn];
int next[maxn],ex[maxn];

void pre_exkmp(char P[])
{
    int m=strlen(P);
    next[0]=m;
    int j=0,k=1;
    while(j+1=n-i)
        {
            pos=i; break;
        }
    }
    for(int i=0;i