結果

問題 No.992 最長増加部分列の数え上げ
ユーザー akakimidori
提出日時 2020-02-14 21:53:38
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 110 ms / 2,000 ms
コード長 3,547 bytes
コンパイル時間 13,806 ms
コンパイル使用メモリ 387,956 KB
実行使用メモリ 9,568 KB
最終ジャッジ日時 2024-10-06 11:29:56
合計ジャッジ時間 18,406 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 42
権限があれば一括ダウンロードができます

ソースコード

diff # 

// ---------- begin ModInt ----------
const MOD: u32 = 1_000_000_007;

#[derive(Clone, Copy)]
struct ModInt(u32);

impl std::ops::Add for ModInt {
    type Output = ModInt;
    fn add(self, rhs: ModInt) -> Self::Output {
        let mut d = self.0 + rhs.0;
        if d >= MOD {
            d -= MOD;
        }
        ModInt(d)
    }
}

impl std::ops::AddAssign for ModInt {
    fn add_assign(&mut self, rhs: ModInt) {
        *self = *self + rhs;
    }
}

impl std::ops::Sub for ModInt {
    type Output = ModInt;
    fn sub(self, rhs: ModInt) -> Self::Output {
        let mut d = self.0 + MOD - rhs.0;
        if d >= MOD {
            d -= MOD;
        }
        ModInt(d)
    }
}

impl std::ops::SubAssign for ModInt {
    fn sub_assign(&mut self, rhs: ModInt) {
        *self = *self - rhs;
    }
}

impl std::ops::Mul for ModInt {
    type Output = ModInt;
    fn mul(self, rhs: ModInt) -> Self::Output {
        ModInt((self.0 as u64 * rhs.0 as u64 % MOD as u64) as u32)
    }
}

impl std::ops::MulAssign for ModInt {
    fn mul_assign(&mut self, rhs: ModInt) {
        *self = *self * rhs;
    }
}

impl std::ops::Neg for ModInt {
    type Output = ModInt;
    fn neg(self) -> Self::Output {
        ModInt(if self.0 == 0 {0} else {MOD - self.0})
    }
}

impl std::fmt::Display for ModInt {
    fn fmt<'a>(&self, f: &mut std::fmt::Formatter<'a>) -> std::fmt::Result {
        write!(f, "{}", self.0)
    }
}

impl std::str::FromStr for ModInt {
    type Err = std::num::ParseIntError;
    fn from_str(s: &str) -> Result<Self, Self::Err> {
        let val = s.parse::<u32>()?;
        Ok(ModInt::new(val))
    }
}

#[allow(dead_code)]
impl ModInt {
    pub fn new(n: u32) -> ModInt {
        ModInt(n % MOD)
    }
    pub fn zero() -> ModInt {
        ModInt(0)
    }
    pub fn one() -> ModInt {
        ModInt(1)
    }
    pub fn pow(self, mut n: u32) -> ModInt {
        let mut t = ModInt::one();
        let mut s = self;
        while n > 0 {
            if n & 1 == 1 {
                t *= s;
            }
            s *= s;
            n >>= 1;
        }
        t
    }
    pub fn inv(self) -> ModInt {
        assert!(self.0 > 0);
        self.pow(MOD - 2)
    }
}
// ---------- end ModInt ----------

use std::io::Read;

fn add(bit: &mut [(usize, ModInt)], x: usize, v: (usize, ModInt)) {
    let mut i = x;
    while i < bit.len() {
        if bit[i].0 < v.0 {
            bit[i] = v;
        } else if bit[i].0 == v.0 {
            bit[i].1 += v.1;
        }
        i += i & (!i + 1);
    }
}

fn sum(bit: &[(usize, ModInt)], x: usize) -> (usize, ModInt) {
    let mut ans = (0, ModInt::one());
    let mut i = x;
    while i > 0 {
        if bit[i].0 > ans.0 {
            ans = bit[i];
        } else if bit[i].0 == ans.0 {
            ans.1 += bit[i].1;
        }
        i -= i & (!i + 1);
    }
    ans
}

fn run() {
    let mut s = String::new();
    std::io::stdin().read_to_string(&mut s).unwrap();
    let mut it = s.trim().split_whitespace();
    let n: usize = it.next().unwrap().parse().unwrap();
    let a: Vec<i32> = it.map(|s| s.parse().unwrap()).collect();
    assert!(a.len() == n);
    let mut b = a.clone();
    b.push(-1_000_000_000 - 1);
    b.sort();
    b.dedup();
    let a: Vec<usize> = a.into_iter().map(|a| b.binary_search(&a).unwrap()).collect();
    let mut bit = vec![(0, ModInt::zero()); b.len()];
    for a in a {
        let s = sum(&bit, a - 1);
        add(&mut bit, a, (s.0 + 1, s.1));
    }
    let ans = sum(&bit, b.len() - 1);
    println!("{}", ans.1);
}

fn main() {
    run();
}
0