// ____ _ _ _ _ // | _ \ _ _ ___| |_ ___ _ __ | |_ ___ _ __ ___ _ __ | | __ _| |_ ___ // | |_) | | | / __| __| / __| '_ \ | __/ _ \ '_ ` _ \| '_ \| |/ _` | __/ _ \ // | _ <| |_| \__ \ |_ | (__| |_) | | || __/ | | | | | |_) | | (_| | || __/ // |_| \_\\__,_|___/\__| \___| .__/___\__\___|_| |_| |_| .__/|_|\__,_|\__\___| // |_| |_____| |_| //https://github.com/manta1130/Competitive_Programming_Template_Rust #[macro_use] mod input { use std; use std::io; const SPLIT_DELIMITER: char = ' '; #[macro_export] #[allow(unused_macros)] macro_rules! input { ( $($x:expr ),*) => { { let temp_str = input_line_str(); let mut split_result_iter = temp_str.split_whitespace(); $( let buf_split_result = split_result_iter.next(); let buf_split_result = buf_split_result.unwrap(); ($x) = buf_split_result.parse().unwrap(); )* } }; } #[allow(dead_code)] pub fn input_line_str() -> String { let mut s = String::new(); io::stdin().read_line(&mut s).unwrap(); s.trim().to_string() } #[allow(dead_code)] pub fn p(t: T) where T: std::fmt::Display, { println!("{}", t); } #[allow(dead_code)] pub fn input_vector2d(line: usize) -> Vec> where T: std::str::FromStr, { let mut v: Vec> = Vec::new(); for _ in 0..line { let vec_line = input_vector(); v.push(vec_line); } v } #[allow(dead_code)] pub fn input_vector() -> Vec where T: std::str::FromStr, { let mut v: Vec = Vec::new(); let s = input_line_str(); let split_result = s.split(SPLIT_DELIMITER); for z in split_result { let buf = match z.parse() { Ok(r) => r, Err(_) => panic!("Parse Error"), }; v.push(buf); } v } #[allow(dead_code)] pub fn input_vector_row(n: usize) -> Vec where T: std::str::FromStr, { let mut v = Vec::with_capacity(n); for _ in 0..n { let buf = match input_line_str().parse() { Ok(r) => r, Err(_) => panic!("Parse Error"), }; v.push(buf); } v } pub trait ToCharVec { fn to_charvec(&self) -> Vec; } impl ToCharVec for String { fn to_charvec(&self) -> Vec { self.to_string().chars().collect::>() } } } use input::*; fn main() { let n: usize; input!(n); let v = input_vector::(); let mut count = 0; let mut prev = v[0]; let mut table = vec![]; for a in &v { if prev == *a { count += 1; } else { prev = *a; table.push(count); count = 1; } } if count != 0 { table.push(count); } //println!("{:?}",table); let mut dp = vec![0;table.len()+1]; dp[0]=0; dp[1]=table[0]; for i in 2..table.len()+1 { dp[i] = std::cmp::max(dp[i - 2] + table[i-1], dp[i - 1]); } //println!("{:?}",&dp); p(dp.iter().last().unwrap()); }