Codeforces 1385D题解

题目描述
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.

Example
input
6
8
bbdcaaaa
8
asdfghjk
8
ceaaaabb
8
bbaaddcc
1
z
2
ac
output
0
7
4
5
1
1
题解：
考虑0-指数化的情景下的问题。定义一个函数calc(l,r,c),这个函数代表了将[l,r)区间变成good string所需的最小步数。让mid=(l+r)/2，然后让cntl=(r−l)/2−count(s[l…mid),c)+calc(mid,r,c+1) ，cntr=(r−l)/2−count(s[mid…r),c)+calc(l,mid,c+1), count(s,c)表示字符c在字符串s中出现的次数。我们可以看到cntl表示的是题目条件中第二种的情况，cntr表示的是第三种情况 所以calc(l,r,c)的返回值是min(cntl,cntr)，一种情况下除外（就是r-l=1的时候）。当r-l=1时，如果sl!=c则返回1，否则返回0。这个函数的时间复杂读是O(nlogn) (s的每一个元素属于logn的线段，类似于线段树，本题的答案是calc(0,n, ′a′)。
以下是代码：

#include<bits/stdc++.h>
using namespace std;
string s;
int t,n;
int cont(int x,int y,char c){
	int tot=0;
	for (int i=x; i<=y; i++)
	    if (s[i]==c)
	       tot++;
	return tot;
}
int calc(int l,int r,char c){
   
	if ((r-l)==1){
		if (s[l]!=c)
		   return 1;
		else return 0;
	}
	int cnt1,cnt2,mid;
	mid=(l+r)/2; 
	cnt1=(r-l)/2-cont(l,mid-1,c)+calc(mid,r,c+1); 
	cnt2=(r-l)/2-cont(mid,r-1,c)+calc(l,mid,c+1);
    return min(cnt1,cnt2);
	
}
int main(){
	cin>>t;
	while (t--){
		  cin>>n;
		  cin>>s;
		  cout<<calc(0,n,'a')<<endl;
	}
	return 0;
}