Hello GDCPC
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1321 Accepted Submission(s): 163
Problem Description
You have a string of lowercase letters.You need to find as many sequence ¡°gdCpc¡± as possible.But letters in the same position can only be used once¡£
Input
The input file contains two lines.
The first line is an integer $n$ show the length of string.($1 \leq n \leq 2 \times 10^5$)
The second line is a string of length n consisting of lowercase letters and uppercase letters.
The first line is an integer $n$ show the length of string.($1 \leq n \leq 2 \times 10^5$)
The second line is a string of length n consisting of lowercase letters and uppercase letters.
Output
The input file contains an integer show the maximum number of different subsequences found.
Sample Input
10 gdCgdCpcpc
Sample Output
2