Problem:
Score : 500 points

Problem Statement

You are given a sequence with N integers: A = \{ A_1, A_2, \cdots, A_N \}.
For each of these N integers, we will choose a color and paint the integer with that color. Here the following condition must be satisfied:

If A_i and A_j (i < j) are painted with the same color, A_i < A_j.

Find the minimum number of colors required to satisfy the condition.

Constraints

1 \leq N \leq 10^5

0 \leq A_i \leq 10^9

Input

Input is given from Standard Input in the following format:

N
A_1
:
A_N

Output

Print the minimum number of colors required to satisfy the condition.

Sample Input 1

5
2
1
4
5
3

Sample Output 1

2

We can satisfy the condition with two colors by, for example, painting 2 and 3 red and painting 1, 4, and 5 blue.

Sample Input 2

4
0
0
0
0

Sample Output 2

4

We have to paint all the integers with distinct colors.

Solution in Rust (1.15.1) (judge verdict: Wrong Answer)

use std::io::Read;
use std::collections::BTreeMap;

fn main() {
  let mut buf = String::new();

  std::io::stdin().read_to_string(&mut buf).unwrap();

  let mut iter = buf.split_whitespace();

  let n: usize = iter.next().unwrap().parse().unwrap();

  let mut colors: BTreeMap<usize, usize> = BTreeMap::new();

  let mut first = true;

  let mut arr = (0..n)
      .map(|_| iter.next().unwrap().parse().unwrap())
      .collect::<Vec<usize>>();
  arr.reverse();

  arr
      .into_iter()
      .fold(0, |after, now| {
        if first {
          first = false;
          return now;
        }

        if now < after {
          return now;
        }
        
        let cs = &mut colors;

        if let Some(colorMin) = cs.clone().keys().next() {
          if after < *colorMin {
            *cs.get_mut(colorMin).unwrap() -= 1;
          }
        }
        if cs.contains_key(&after) {
          *cs.get_mut(&after).unwrap() += 1;
        } else {
          cs.insert(after, 1);
        }

        now
      });
  
  println!("{}", colors.values().sum::<usize>()+1)
}