CodeForces 570C Replacement 统计

原题： http://codeforces.com/contest/570/problem/C

题目：

Replacement
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
Daniel has a string s, consisting of lowercase English letters and period signs (characters ‘.’). Let’s define the operation of replacement as the following sequence of steps: find a substring “..” (two consecutive periods) in string s, of all occurrences of the substring let’s choose the first one, and replace this substring with string “.”. In other words, during the replacement operation, the first two consecutive periods are replaced by one. If string s contains no two consecutive periods, then nothing happens.

Let’s define f(s) as the minimum number of operations of replacement to perform, so that the string does not have any two consecutive periods left.

You need to process m queries, the i-th results in that the character at position xi (1 ≤ xi ≤ n) of string s is assigned value ci. After each operation you have to calculate and output the value of f(s).

Help Daniel to process all queries.

Input
The first line contains two integers n and m (1 ≤ n, m ≤ 300 000) the length of the string and the number of queries.

The second line contains string s, consisting of n lowercase English letters and period signs.

The following m lines contain the descriptions of queries. The i-th line contains integer xi and ci (1 ≤ xi ≤ n, ci — a lowercas English letter or a period sign), describing the query of assigning symbol ci to position xi.

Output
Print m numbers, one per line, the i-th of these numbers must be equal to the value of f(s) after performing the i-th assignment.

Sample test(s)
input
10 3
.b..bz….
1 h
3 c
9 f
output
4
3
1
input
4 4
.cc.
2 .
3 .
2 a
1 a
output
1
3
1
1
Note
Note to the first sample test (replaced periods are enclosed in square brackets).

The original string is “.b..bz….”.

after the first query f(hb..bz….) = 4 (“hb[..]bz….”  →  “hb.bz[..]..”  →  “hb.bz[..].”  →  “hb.bz[..]”  →  “hb.bz.”)
after the second query f(hbс.bz….) = 3 (“hbс.bz[..]..”  →  “hbс.bz[..].”  →  “hbс.bz[..]”  →  “hbс.bz.”)
after the third query f(hbс.bz..f.) = 1 (“hbс.bz[..]f.”  →  “hbс.bz.f.”)
Note to the second sample test.

The original string is “.cc.”.

after the first query: f(..c.) = 1 (“[..]c.”  →  “.c.”)
after the second query: f(….) = 3 (“[..]..”  →  “[..].”  →  “[..]”  →  “.”)
after the third query: f(.a..) = 1 (“.a[..]”  →  “.a.”)
after the fourth query: f(aa..) = 1 (“aa[..]”  →  “aa.”)

思路：

对于连续有n个‘.’，我们的答案是n-1，就可以理解为点是空格，其他是单词字符，在不改变单词的情况下，有多少空格可以删。也就是该有点的地方除了一个点还有多少个点。

我们只需要考虑修改后的元素和之前元素的不同，如果都为点或者字母，答案不变。
如果之前是点，两边都是点，现在改成字符，那么结果要减2，因为不管其他地方的，至少该位置的点不能被删去了，它后面的点因为它的存在也不能删去了。
枚举每一种情况，就得出了结果。

代码：

#include <iostream>
#include"stdio.h"
#include"stdlib.h"
#include"string.h"
#include"algorithm"
#include"string"
using namespace std;
typedef long long int lint;

const int N= 300005;
char s[N];

int main()
{
    //freopen("in.txt","r",stdin);
    int n,m;
    while(scanf("%d %d",&n,&m)!=EOF)
    {
        int cut=0;
        scanf("%s",s);
        for(int i=0; i<n;)
        {
            if(s[i]=='.')
            {
                i++;
                while(s[i]=='.')
                {
                    cut++;
                    i++;
                }
            }
            else
                i++;
        }
//        printf("%d\n",cut);
        char tt[10];
        int where;
        while(m--)
        {
            scanf("%d %s",&where,tt);
            where--;
            if(where>0&&where<n-1)
            {
                if(tt[0]=='.'&&s[where]!='.')
                {
                    if(s[where-1]=='.'&&s[where+1]=='.')    cut=cut+2;
                    else if(s[where-1]=='.'&&s[where+1]!='.')   cut++;
                    else if(s[where-1]!='.'&&s[where+1]=='.')   cut++;
                }
                else if(tt[0]!='.'&&s[where]=='.')
                {
                    if(s[where-1]=='.'&&s[where+1]=='.')    cut=cut-2;
                    else if(s[where-1]=='.'&&s[where+1]!='.')   cut--;
                    else if(s[where-1]!='.'&&s[where+1]=='.')   cut--;
                }
            }
            else if(where==0)
            {
                 if(tt[0]=='.'&&s[where]!='.')
                {
                    if(s[where+1]=='.')    cut++;
                }
                else if(tt[0]!='.'&&s[where]=='.')
                {
                    if(s[where+1]=='.')    cut--;
                }
            }
            else if(where==n-1)
            {
                 if(tt[0]=='.'&&s[where]!='.')
                {
                    if(s[where-1]=='.')    cut++;
                }
                else if(tt[0]!='.'&&s[where]=='.')
                {
                    if(s[where-1]=='.')    cut--;
                }
            }
            s[where]=tt[0];
            printf("%d\n",cut);
        }

    }
    return 0;
}