light oj 1258 - Making Huge Palindromes(KMP)

//2013-05-13-20.01
#include <stdio.h>
#include <string.h>
const int maxn = 1000005;
char a[maxn];
char b[maxn];
int f[maxn];


void getfail()
{
    int l = strlen(b);
    f[0] = 0;
    f[1] = 0;
    for (int i = 1; i < l; i++)
    {
        int j = f[i];
        while (j && b[i] != b[j])
            j = f[j];
        if (b[i] == b[j])
            f[i+1] = j+1;
        else
            f[i+1] = 0;
    }
}


int getans()
{
    int la = strlen(a);
    int lb = strlen(b);
    getfail();
    int j = 0;
    for (int i = 0; i < la; i++)
    {
        while (j && a[i] != b[j])
            j = f[j];
        if (b[j] == a[i])
            j++;
    }
    return la + lb - j;
}


int main()
{
    int t;
    scanf("%d", &t);
    for (int i = 1; i <= t; i++)
    {
        scanf("%s", a);
        int l = strlen(a);
        for (int j = 0; j < l; j++)
        {
            b[l-j-1] = a[j];
        }
        b[l] = '\0';
        printf("Case %d: %d\n", i, getans());
    }
    return 0;
}