aizu_online_judge/dpl/dpl_1_d.rs
1use competitive::combinatorial_optimization::LongestIncreasingSubsequence;
2use competitive::prelude::*;
3
4#[verify::aizu_online_judge("DPL_1_D")]
5pub fn dpl_1_d(reader: impl Read, writer: impl Write) {
6 prepare_io!(reader, writer);
7 sc!(n, a: [u64; iter n]);
8 let mut lis = LongestIncreasingSubsequence::new();
9 lis.extend(a);
10 pp!(lis.longest_length());
11}