Arranging The Sheep（移动思维）

You are playing the game “Arranging The Sheep”. The goal of this game is to make the sheep line up. The level in the game is described by a string of length n, consisting of the characters ‘.’ (empty space) and ‘*’ (sheep). In one move, you can move any sheep one square to the left or one square to the right, if the corresponding square exists and is empty. The game ends as soon as the sheep are lined up, that is, there should be no empty cells between any sheep.

For example, if n=6 and the level is described by the string “**.*…”, then the following game scenario is possible:

the sheep at the 4 position moves to the right, the state of the level:
"**..*.";
the sheep at the 2 position moves to the right, the state of the level:
"*.*.*.";
the sheep at the 1 position moves to the right, the state of the level:
".**.*.";
the sheep at the 3 position moves to the right, the state of the level:
".*.**.";
the sheep at the 2 position moves to the right, the state of the level:
"..***.";
the sheep are lined up and the game ends.
For a given level, determine the minimum number of moves you need to make to complete the level.

Input

The first line contains one integer t (1≤t≤104). Then t test cases follow.

The first line of each test case contains one integer n (1≤n≤106).

The second line of each test case contains a string of length n, consisting of the characters ‘.’ (empty space) and ‘*’ (sheep) — the description of the level.

It is guaranteed that the sum of n over all test cases does not exceed 106.

Output

For each test case output the minimum number of moves you need to make to complete the level.

Example Input

5
6
**.*..
5
*****

3
.*.
3
...
10
*.*...*.**

Output

1
0
0
0
9

题意：*代表🐏（羊），需要让所有的🐏紧靠在一起，例如：*..**.*,变成：..****.。求🐏需要移动的最小次数。

题解：先预处理一下，定义一个数组s[k]，表示的是第k个🐏的下标。定义midd，表示的是🐏的中位数，就是最中间的那只🐏。

所以：s[midd]-s[i]，就是第i只🐏移动到最中间所需要的步数。

但是我们知道，只有最中间的那只🐏在中间，其他的🐏都在最中间的那只🐏的两边，所以还要减去midd-i就是第i只🐏排在第几个位置。

所以每只🐏需要移动的步数为：

s[midd]-s[i]-(midd-i)。

经过整理为：(s[midd]-midd)-(s[i]-i),所以可以预处理一下s[i]=s[i]-i，即可整理为公式：

s[midd]-s[i]。

AC代码：

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<stdlib.h>
#include<queue>
#include<stack>
#include<vector>
#include<map>
#include<algorithm>
using namespace std;
typedef long long ll;
const int maxn=1e6+10;
char a[maxn];
int s[maxn];
int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		int n;
		scanf("%d",&n);
		scanf("%s",a);
		int d=0;
		int i,j,k;
		for(i=0; i<n; i++)
			if(a[i]=='*')
				s[d++]=i;
		int midd=d/2;
		ll sum=0;
		for(i=0; i<d; i++)
			s[i]-=i;
		for(i=0; i<d; i++)
			sum+=abs(s[midd]-s[i]);
		printf("%lld\n",sum);
	}
	return 0;
}