fn rand_memory() -> usize { Box::into_raw(Box::new("I hope this is a random number")) as usize } fn rand() -> usize { static mut X: usize = 0; unsafe { if X == 0 { X = rand_memory(); } X ^= X << 13; X ^= X >> 17; X ^= X << 5; X } } fn shuffle(a: &mut [T]) { for i in 1..a.len() { let p = rand() % (i + 1); a.swap(i, p); } } fn stress() { for _ in 0..1000 { let n = rand() % 30 + 1; let s = (0..n).map(|_| ((rand() % 3) as u8 + b'A') as char).collect::>(); let x = naive(s.clone()); let y = test(s.clone()); use util::*; if x != y { println!("Hack! {}: {} {}", s.iter().map(|s| *s as u8 - b'A').join(""), x, y); } } } fn naive(s: Vec) -> usize { let mut z = s.clone(); z.sort(); z.dedup(); let s = s.iter().map(|c| z.binary_search(c).unwrap()).collect::>(); let n = s.len(); let inf = n + 1; let mut dp = vec![vec![[inf; 3]; n]; n]; for (i, s) in s.iter().enumerate() { dp[i][i] = [1; 3]; dp[i][i][*s] = 0; } for l in (0..n).rev() { for r in (l + 1)..n { let mut val = [inf; 3]; for m in l..r { for i in 0..3 { val[i] = val[i].min(dp[l][m][i] + dp[m + 1][r][i]); } } val[s[l]] = val[s[l]].min(dp[l + 1][r][s[l]]); val[s[r]] = val[s[r]].min(dp[l][r - 1][s[r]]); for i in 0..3 { for j in 0..3 { val[j] = val[j].min(val[i] + 1); } } dp[l][r] = val; } } *dp[0][n - 1].iter().min().unwrap() + 1 } fn test(s: Vec) -> usize { let mut s = s; s.dedup(); let mut ans = 0; let mut stack = vec![s[0]]; for &s in s[1..].iter() { let k = stack.len(); if k >= 2 && stack[k - 2] == s { ans += 1; stack.pop(); } else { stack.push(s); } } ans += if stack.len() <= 3 { stack.len() } else { stack.len() - (stack.len() - 1) / 3 }; ans } fn run() { input! { n: usize, s: chars, } let ans = test(s); println!("{}", ans); } fn main() { run(); } mod util { pub trait Join { fn join(self, sep: &str) -> String; } impl Join for I where I: Iterator, T: std::fmt::Display, { fn join(self, sep: &str) -> String { let mut s = String::new(); use std::fmt::*; for (i, v) in self.enumerate() { if i > 0 { write!(&mut s, "{}", sep).ok(); } write!(&mut s, "{}", v).ok(); } s } } } // ---------- begin input macro ---------- // reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8 #[macro_export] macro_rules! input { (source = $s:expr, $($r:tt)*) => { let mut iter = $s.split_whitespace(); input_inner!{iter, $($r)*} }; ($($r:tt)*) => { let s = { use std::io::Read; let mut s = String::new(); std::io::stdin().read_to_string(&mut s).unwrap(); s }; let mut iter = s.split_whitespace(); input_inner!{iter, $($r)*} }; } #[macro_export] macro_rules! input_inner { ($iter:expr) => {}; ($iter:expr, ) => {}; ($iter:expr, $var:ident : $t:tt $($r:tt)*) => { let $var = read_value!($iter, $t); input_inner!{$iter $($r)*} }; } #[macro_export] macro_rules! read_value { ($iter:expr, ( $($t:tt),* )) => { ( $(read_value!($iter, $t)),* ) }; ($iter:expr, [ $t:tt ; $len:expr ]) => { (0..$len).map(|_| read_value!($iter, $t)).collect::>() }; ($iter:expr, chars) => { read_value!($iter, String).chars().collect::>() }; ($iter:expr, bytes) => { read_value!($iter, String).bytes().collect::>() }; ($iter:expr, usize1) => { read_value!($iter, usize) - 1 }; ($iter:expr, $t:ty) => { $iter.next().unwrap().parse::<$t>().expect("Parse error") }; } // ---------- end input macro ----------