Skip to content

ABC-382

A

URLURL\:\to

解法


B

URLURL\:\to

解法


C

URLURL\:\to https://atcoder.jp/contests/abc382/tasks/abc382_c

#二分探索

input! {
n: usize,
m: usize,
mut a: [u32; n],
b: [u32; m],
};
let mut c: Vec<u32> = vec![a[0]];
for i in 1..n {
c.push(c[i-1].min(a[i]));
}
let min: u32 = c[c.len()-1];
for i in b {
println!("{}", if i < min {
-1
} else {
(binary_search(&c, i, true, true)+1) as isize
});
}

解法


D

URLURL\:\to

解法


E

URLURL\:\to

解法