Problem:
Score : 300 points

Problem Statement

There are N stones arranged in a row. Every stone is painted white or black.
A string S represents the color of the stones. The i-th stone from the left is white if the i-th character of S is ., and the stone is black if the character is #.

Takahashi wants to change the colors of some stones to black or white so that there will be no white stone immediately to the right of a black stone.
Find the minimum number of stones that needs to be recolored.

Constraints

1 \leq N \leq 2\times 10^5

S is a string of length N consisting of . and #.

Input

Input is given from Standard Input in the following format:

N
S

Output

Print the minimum number of stones that needs to be recolored.

Sample Input 1

3
#.#

Sample Output 1

1

It is enough to change the color of the first stone to white.

Sample Input 2

5
#.##.

Sample Output 2

2

Sample Input 3

9
.........

Sample Output 3

0

Solution in Rust (1.15.1) (judge verdict: Accepted)

#![allow(non_snake_case)]

use std::io::{stdin, Read};
use std::str::FromStr;
fn read_option<T: FromStr>() -> Option<T> {
    let stdin = stdin();
    let stdin = stdin.lock();
    let token: String = stdin
        .bytes()
        .map(|c| c.expect("failed to read char") as char)
        .skip_while(|c| c.is_whitespace())
        .take_while(|c| !c.is_whitespace())
        .collect();
    token.parse().ok()
}
fn read<T: FromStr>() -> T {
    let opt = read_option();
    opt.expect("failed to parse token")
}

fn main() {
    let _N: usize = read();
    let S: String = read();
    let whiteCount = S.chars().filter(|&c| c == '.').count();
    let (ans, _blackCount, _whiteCount) = S.chars().fold(
        (std::usize::MAX, 0, whiteCount),
        |(ans, leftBlackCount, rightWhiteCount), c| {
            let (leftBlackCount, rightWhiteCount) = if c == '.' {
                (leftBlackCount, rightWhiteCount - 1)
            } else {
                (leftBlackCount, rightWhiteCount)
            };
            let (leftBlackCount, rightWhiteCount) = if c == '#' {
                (leftBlackCount + 1, rightWhiteCount)
            } else {
                (leftBlackCount, rightWhiteCount)
            };
            let ans = std::cmp::min(ans, leftBlackCount + rightWhiteCount);
            (ans, leftBlackCount, rightWhiteCount)
        },
    );
    // 先頭の判定をしていないのでここでする
    let ans = std::cmp::min(ans, whiteCount);
    println!("{}", ans);
}