找出一个字符串中最长回文子串

#include<stdio.h>


int func(char *a,int n)
{
int l = 1,l1=1;
int i = 0,j = 0;
int i1 = 0,j1 = 0;
while(i<n)
{
j = i;
while(j<n)
{
if(a[i] == a[j]&&i!=j)
{
i1 = i;
j1 = j;
while(a[i1]==a[j1]&&i1!=j1)
{
i1++;
if(i1==j1)
{
break;
}
j1--;

}
if(i1==j1)
{
l1=j-i+1;
if(l < l1)
{
l = l1;
}
}
}
j++;
}
i++;
}
return l;
 } 
 
int main()
{
char a[20]="abbaabbaabba";
int l=func(a,12);
printf("%d\n",l);
return 0;

 }