H - Students in Railway Carriage

There are nn consecutive seat places in a railway carriage. Each place is either empty or occupied by a passenger.

The university team for the Olympiad consists of aa student-programmers and bb student-athletes. Determine the largest number of students from all a+ba+b students, which you can put in the railway carriage so that:

no student-programmer is sitting next to the student-programmer;
and no student-athlete is sitting next to the student-athlete.
In the other words, there should not be two consecutive (adjacent) places where two student-athletes or two student-programmers are sitting.

Consider that initially occupied seat places are occupied by jury members (who obviously are not students at all).

Input
The first line contain three integers nn, aa and bb (1≤n≤2⋅1051≤n≤2⋅105, 0≤a,b≤2⋅1050≤a,b≤2⋅105, a+b>0a+b>0) — total number of seat places in the railway carriage, the number of student-programmers and the number of student-athletes.

The second line contains a string with length nn, consisting of characters "." and "*". The dot means that the corresponding place is empty. The asterisk means that the corresponding place is occupied by the jury member.

Output
Print the largest number of students, which you can put in the railway carriage so that no student-programmer is sitting next to a student-programmer and no student-athlete is sitting next to a student-athlete.

Examples
Input
5 1 1
*...*
Output
2
Input
6 2 3
*...*.
Output
4
Input
11 3 10
.*....**.*.
Output
7
Input
3 2 3
***
Output
0
Note
In the first example you can put all student, for example, in the following way: *.AB*

In the second example you can put four students, for example, in the following way: *BAB*B

In the third example you can put seven students, for example, in the following way: B*ABAB**A*B

The letter A means a student-programmer, and the letter B — student-athlete.
题意：有n个座位，只有'.'的位置可以坐人，安排a名A同学，b名B同学入座，要求不能同类的坐在一起，问最多可以坐多少人。
思路：对于往里面安排人，A和B要分开坐，哪一类人多，就先安排哪一类。

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<queue>
#include<algorithm>
using namespace std;
char s[200010];
int n,a,b;
int main()
{
    while(~scanf("%d%d%d",&n,&a,&b))
    {
        getchar();
        scanf("%s",s);
        int ans=0;
        for(int i=0; i<n; i++)
        {
            if(s[i]=='.')
            {
                if(a>=b)
                {
                    if(s[i-1]!='A'&&a)
                    {
                        s[i]='A';
                        ans++;
                        a--;
                    }
                    else if(s[i-1]!='B'&&b)
                    {
                        s[i]='B';
                        ans++;
                        b--;
                    }
                }
                else if(a<b)
                {
                    if(s[i-1]!='B'&&b)
                    {
                        s[i]='B';
                        ans++;
                        b--;
                    }
                    else if(s[i-1]!='A'&&a)
                    {
                        s[i]='A';
                        ans++;
                        a--;
                    }
                }
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}