E Arranging The Sheep Codeforces Round #719 (Div. 3)

E. Arranging The Sheep
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
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
inputCopy
5
6
**.*…
5

---

3
..
3
…
10
.….**
outputCopy
1
0
0
0
9

题意：
让你找所有羊紧挨着在一起需要的最少移动次数

思路：
移动思维，我们可以记录所有羊的位置，并且取中位数，然后统计每个羊到中位数这个羊的移动次数之和；
在求和过程中不要忘记减去已经移过去的羊所占的位置；（结果卡ll）

我不理解的是如果个数是偶数个，中位数怎么取，后来画了画图，发现取哪个点都一样的路程罢了（蒟蒻叹息）

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e6+7;
int pos[N];
int main(){
	
	int _;
	cin>>_;
	while(_--){
		
		int n;
		cin>>n;
		string s;
		cin>>s;
		int cnt=0;
		for(int i=0;i<n;i++){
			if(s[i]=='*') pos[cnt++]=i;
		}
		
		int mid=pos[cnt/2];
		
		ll sum=0;
		int r=0,l=0;
		for(int i=0;i<cnt;i++){
			if(pos[i]<mid){
				l++;
				sum+=abs(mid-pos[i])-l;
			}
			else if(pos[i]>mid){
				r++;
				sum+=abs(pos[i]-mid)-r;
			}
		}
		cout<<sum<<endl;
		
	}
	
	return 0;
}