Submission #71702273

---

Source Code Expand

use std::collections::BTreeSet;

use proconio::{input, marker::Usize1};

fn main() {
    input! {
        n: usize,
        b: [Usize1; n],
    }

    let mut result = 0;
    for i in 0..n {
        let mut set = BTreeSet::new();
        for j in i..n {
            set.insert(b[j]);
            result += 1;
            for &x in set.iter().rev() {
                if x != b[i] && x != b[j] {
                    result += 1;
                } else {
                    break;
                }
            }
        }
    }
    println!("{result}");
}

Submission Info

Judge Result