use std::collections::BTreeSet; fn lower_bound(target: usize, vals: &Vec) -> usize { let mut upper = vals.len(); let mut lower = 0usize; while upper > lower { let middle = (upper + lower) / 2; if vals[middle] < target { lower = middle+1; } else { upper = middle; } } upper } fn upper_bound(target: usize, vals: &Vec) -> usize { let mut upper = vals.len(); let mut lower = 0usize; while upper > lower { let middle = (upper + lower) / 2; if vals[middle] <= target { lower = middle+1; } else { upper = middle; } } upper } fn main() { let mut nm = String::new(); std::io::stdin().read_line(&mut nm).ok(); let nm: Vec = nm.trim().split_whitespace().map(|s| s.parse().unwrap()).collect(); let n = nm[0]; let m = nm[1]; let d = (0..n).map(|_| { let mut temp = String::new(); std::io::stdin().read_line(&mut temp).ok(); let temp: Vec = temp.trim().split_whitespace().map(|s| s.parse::().unwrap()).collect::>().into_iter().collect::>(); temp }) .collect::>(); let mut lower = 0usize; let mut upper = 2000000000usize; let mut flg = true; while upper > lower { let middle = (upper + lower) / 2; let mut dp = d[0].clone().to_owned(); for i in 1..n { let mut next_dp = vec![]; for &v in d[i].iter() { let left = if v <= middle { 1 } else { v - middle }; let right = v; let lidx = lower_bound(left, &dp); let ridx = upper_bound(right, &dp); if lidx < ridx { next_dp.push(v); } } if flg && next_dp.is_empty() { println!("-1"); return; } dp = next_dp; } flg = false; if dp.is_empty() { lower = middle + 1; } else { upper = middle; } } println!("{}", upper); }