Submission #73101119

---

Source Code Expand

use proconio::input;
use std::collections::BTreeSet;

#[proconio::fastout]
fn main() {
    input! {
        n: usize,
        d: i64,
        a: [i64; n],
    }

    let mut set = BTreeSet::new();
    let mut r = 0;
    let mut ans = 0i64;

    for l in 0..n {
        while r < n {
            let x = a[r];
            let pred = set.range(..x).next_back();
            let succ = set.range(x..).next();

            let mut ok = true;
            if let Some(&p) = pred {
                if x - p < d {
                    ok = false;
                }
            }
            if ok {
                if let Some(&s) = succ {
                    if s - x < d {
                        ok = false;
                    }
                }
            }

            if ok {
                set.insert(x);
                r += 1;
            } else {
                break;
            }
        }

        ans += (r - l) as i64;

        set.remove(&a[l]);
    }

    println!("{}", ans);
}

Submission Info

Judge Result