B - Partial Replacement

***B - Partial Replacement ***

题目：

You are given a number k and a string s of length n, consisting of the characters ‘.’ and ‘’. You want to replace some of the '’ characters with ‘x’ characters so that the following conditions are met:
The first character ‘’ in the original string should be replaced with ‘x’;
The last character '’ in the original string should be replaced with ‘x’;
The distance between two neighboring replaced characters ‘x’ must not exceed k (more formally, if you replaced characters at positions i and j (i<j) and at positions [i+1,j−1] there is no “x” symbol, then j−i must be no more than k).
For example, if n=7, s=..* and k=3, then the following strings will satisfy the conditions above:
.xx.xx;
.x.xx;
.xx.xxx.
But, for example, the following strings will not meet the conditions:
.**.xx (the first character '’ should be replaced with ‘x’);
.x.xx* (the last character ‘’ should be replaced with ‘x’);
.x.xx (the distance between characters at positions 2 and 6 is greater than k=3).
Given n, k, and s, find the minimum number of '’ characters that must be replaced with ‘x’ in order to meet the above conditions.
Input
The first line contains one integer t (1≤t≤500). Then t test cases follow.
The first line of each test case contains two integers n and k (1≤k≤n≤50).
The second line of each test case contains a string s of length n, consisting of the characters ‘.’ and ‘’.
It is guaranteed that there is at least one '’ in the string s.
It is guaranteed that the distance between any two neighboring ‘’ characters does not exceed k.
Output
For each test case output the minimum number of '’ characters that must be replaced with ‘x’ characters in order to satisfy the conditions above.

5
7 3
.**.***
5 1
..*..
5 2
*.*.*
3 2
*.*
1 1
*

3
1
3
2
1

#include<iostream>
int main()
{
    char s[10001]; 
    long long t,n,k,qq = -1,ss = n,sum;  //t,n,k如题
    cin>>t;
    while(t--)
    {
        cin>>n>>k>>s;
        sum = 0;
        for(int i = 0; i < n; ++i)                  //找到第一个
            if(s[i] == '*')
            {
                s[i] = 'x',qq = i,++sum;//printf("11    %d     ",i);
                break;
            }
        for(int i = n - 1; i >= 0; --i)             //找到最后一个
            if(s[i] == '*')
            {
                s[i] = 'x',ss = i,++sum;//printf("22    %d     ",i);
                break;
            }
        for(int i = qq; i < ss - k;)     //贪心，隔得越远越好
        {
            for(int j = i + k; j > i; --j)
                if(s[j] == '*')
                {
                    ++sum,i = j;
                    //printf("33    %d     \n",i);
                    break;
                }
            if(s[i] == '*')
                s[i] = 'x';
            else
                break;
        }
        //printf("     \n");
        cout<<sum<<"\n";
    }
    return 0;
}