Problem:
Score : 700 points

Problem Statement

There are N stones arranged in a row. The i-th stone from the left is painted in the color C_i.

Snuke will perform the following operation zero or more times:

Choose two stones painted in the same color. Repaint all the stones between them, with the color of the chosen stones.

Find the number of possible final sequences of colors of the stones, modulo 10^9+7.

Constraints

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

1 \leq C_i \leq 2\times 10^5(1\leq i\leq N)

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N
C_1
:
C_N

Output

Print the number of possible final sequences of colors of the stones, modulo 10^9+7.

Sample Input 1

5
1
2
1
2
2

Sample Output 1

3

We can make three sequences of colors of stones, as follows:

(1,2,1,2,2), by doing nothing.

(1,1,1,2,2), by choosing the first and third stones to perform the operation.

(1,2,2,2,2), by choosing the second and fourth stones to perform the operation.

Sample Input 2

6
4
2
5
4
2
4

Sample Output 2

5

Sample Input 3

7
1
3
1
2
3
3
2

Sample Output 3

5

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

fn main() {
    use std::io::Read;
    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 c = vec![];
    for _ in 0..n {
        let x: u64 = iter.next().unwrap().parse().unwrap();
        c.push(x);
    }

    let mut indices = std::collections::HashMap::new();
    for i in 0..n {
        indices.entry(c[i]).or_insert(vec![]).push(i);
    }

    let mut dp = vec![0;n+1];
    dp[0] = 1;
    for i in 0..n {
        let next_index = match indices.get(&c[i]) {
            None => None,
            Some(arr) => {
                let idx = arr.lower_bound(&i);
                if idx + 1 < arr.len() && arr[idx+1] != i+1 {
                    Some(arr[idx+1])
                } else {
                    None
                }
            }
        };
        if let Some(v) = next_index {
            dp[v] += dp[i];
            dp[v] %= M;
        }
        dp[i+1] += dp[i];
        dp[i+1] %= M;
    }
    println!("{}", dp[n]);
}

#[allow(dead_code)]
pub const M: u64 = 1_000_000_007;

#[doc = " https://qiita.com/hatoo@github/items/fa14ad36a1b568d14f3e"]
pub trait BinarySearch<T> {
    #[doc = " Return the position of the first element **greater than or equal to** element x"]
    fn lower_bound(&self, x: &T) -> usize;
    #[doc = " Return the position of the first element **greater than** element x"]
    fn upper_bound(&self, x: &T) -> usize;
}
#[doc = " sorted slice required"]
impl<T: Ord> BinarySearch<T> for [T] {
    fn lower_bound(&self, x: &T) -> usize {
        let mut low = 0;
        let mut high = self.len();
        while low != high {
            let mid = (low + high) / 2;
            match self[mid].cmp(x) {
                std::cmp::Ordering::Less => {
                    low = mid + 1;
                }
                _ => {
                    high = mid;
                }
            }
        }
        low
    }
    fn upper_bound(&self, x: &T) -> usize {
        let mut low = 0;
        let mut high = self.len();
        while low != high {
            let mid = (low + high) / 2;
            match self[mid].cmp(x) {
                std::cmp::Ordering::Greater => {
                    high = mid;
                }
                _ => {
                    low = mid + 1;
                }
            }
        }
        low
    }
}