This documentation is automatically generated by competitive-verifier/competitive-verifier
// verification-helper: PROBLEM https://judge.yosupo.jp/problem/cartesian_tree
use itertools::Itertools;
use proconio::input;
use cartesian_tree::CartesianTree;
fn main() {
input! {
n: usize,
a: [usize; n],
}
let mut ct = CartesianTree::new(a);
println!("{}", ct.run(true).iter().enumerate().map(|(i, &p)| if p == n { i } else { p }).join(" "));
}
| Env | Name | Status | Elapsed | Memory |
|---|---|---|---|---|
| Rust | almost-decreasing_00 |
|
79 ms | 58 MB |
| Rust | almost-decreasing_01 |
|
42 ms | 28 MB |
| Rust | almost-increasing_00 |
|
84 ms | 59 MB |
| Rust | almost-increasing_01 |
|
44 ms | 30 MB |
| Rust | decreasing_00 |
|
79 ms | 58 MB |
| Rust | decreasing_01 |
|
41 ms | 28 MB |
| Rust | example_00 |
|
6 ms | 2 MB |
| Rust | example_01 |
|
5 ms | 2 MB |
| Rust | increasing_00 |
|
84 ms | 59 MB |
| Rust | increasing_01 |
|
43 ms | 28 MB |
| Rust | random_00 |
|
87 ms | 58 MB |
| Rust | random_01 |
|
45 ms | 28 MB |
| Rust | random_02 |
|
54 ms | 34 MB |
| Rust | random_03 |
|
43 ms | 26 MB |
| Rust | random_04 |
|
70 ms | 46 MB |
| Rust | small_00 |
|
6 ms | 2 MB |
| Rust | small_01 |
|
5 ms | 2 MB |
| Rust | small_02 |
|
5 ms | 2 MB |
| Rust | small_03 |
|
5 ms | 2 MB |
| Rust | small_04 |
|
5 ms | 2 MB |
| Rust | small_05 |
|
5 ms | 2 MB |
| Rust | small_06 |
|
5 ms | 2 MB |
| Rust | small_07 |
|
5 ms | 2 MB |
| Rust | small_08 |
|
5 ms | 2 MB |
| Rust | small_09 |
|
5 ms | 2 MB |