D. a-Good String

D. a-Good String

D. a-Good String time limit per test2 seconds memory limit per test256
megabytes inputstandard input outputstandard output You are given a
string s[1…n] consisting of lowercase Latin letters. It is guaranteed
that n=2k for some integer k≥0.

The string s[1…n] is called c-good if at least one of the following
three conditions is satisfied:

The length of s is 1, and it consists of the character c (i.e. s1=c);
The length of s is greater than 1, the first half of the string
consists of only the character c (i.e. s1=s2=⋯=sn2=c) and the second
half of the string (i.e. the string sn2+1sn2+2…sn) is a (c+1)-good
string; The length of s is greater than 1, the second half of the
string consists of only the character c (i.e. sn2+1=sn2+2=⋯=sn=c) and
the first half of the string (i.e. the string s1s2…sn2) is a
(c+1)-good string. For example: “aabc” is ‘a’-good, “ffgheeee” is
‘e’-good.

In one move, you can choose one index i from 1 to n and replace si
with any lowercase Latin letter (any character from ‘a’ to ‘z’).

Your task is to find the minimum number of moves required to obtain an
‘a’-good string from s (i.e. c-good string for c= ‘a’). It is
guaranteed that the answer always exists.

You have to answer t independent test cases.

Another example of an ‘a’-good string is as follows. Consider the
string s=“cdbbaaaa”. It is an ‘a’-good string, because:

the second half of the string (“aaaa”) consists of only the character
‘a’; the first half of the string (“cdbb”) is ‘b’-good string,
because: the second half of the string (“bb”) consists of only the
character ‘b’; the first half of the string (“cd”) is ‘c’-good string,
because: the first half of the string (“c”) consists of only the
character ‘c’; the second half of the string (“d”) is ‘d’-good string.
Input The first line of the input contains one integer t (1≤t≤2⋅104) —
the number of test cases. Then t test cases follow.

The first line of the test case contains one integer n (1≤n≤131 072) —
the length of s. It is guaranteed that n=2k for some integer k≥0. The
second line of the test case contains the string s consisting of n
lowercase Latin letters.

It is guaranteed that the sum of n does not exceed 2⋅105 (∑n≤2⋅105).

Output For each test case, print the answer — the minimum number of
moves required to obtain an ‘a’-good string from s (i.e. c-good string
with c= ‘a’). It is guaranteed that the answer exists.

本以为这题有特殊的处理方法，但是却是暴力dfs。

int dfs(int l,int r,int c)
{
    if(l==r){
        if(char('a'+c)==s[l])return 0;
        return 1;
    }    int mid=(l+r)>>1;
    int c_l=(mid-l+1)-az[c][mid]+az[c][l-1];
    int d_r=dfs(l,mid,c+1);
    int c_r=(mid-l+1)-az[c][r]+az[c][mid];
    int d_l=dfs(mid+1,r,c+1);
    return min(c_l+d_l,c_r+d_r);
}
int main()
{

    int t;
    cin>>t;
    while(t--)
    {
        int n;
        cin>>n;
        resive=0;
        len=0;int kk=n;
        while(kk!=1){len++;kk/=2;}
        for(int i=0;i<=len;i++)
            for(int j=0;j<=n;j++)
            az[i][j]=0;
        cin>>s+1;
        char m=char('a'+len);
        for(int i=1;i<=n;i++){
            if(s[i]<=m){
            az[s[i]-'a'][i]++;
            }

        }
        for(int i=1;i<=n;i++)
            for(int l=0;l<=len;l++)
            az[l][i]+=az[l][i-1];
        cout<<dfs(1,n,0)<<endl;
    }
}