Super-palindrome

http://icpc.upc.edu.cn/problem.php?cid=1723&pid=0

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
using namespace std;
char c[10000];
int b[100000],j,i,l,n,d[10000];
int main()
{
    scanf("%d",&n);
    for (i=1; i<=n; i++)
    {
        int max1=0,max2=0;
        scanf("%s",c);
        l=strlen(c);
        memset(d,0,sizeof(d));
        memset(b,0,sizeof(b));
        for (j=0; j<l; j+=2)
        {
            b[c[j]]++;
            max1=max(b[c[j]],max1);
        }
        for (j=1; j<l; j+=2)
        {
            d[c[j]]++;
            max2=max(max2,d[c[j]]);
        }
        printf("%d\n",l-max1-max2);
    }
}