#![allow(non_snake_case, unused_imports, unused_must_use)] use std::io::{self, prelude::*}; use std::str; fn main() { let (stdin, stdout) = (io::stdin(), io::stdout()); let mut scan = Scanner::new(stdin.lock()); let mut out = io::BufWriter::new(stdout.lock()); macro_rules! input { ($T: ty) => { scan.token::<$T>() }; ($T: ty, $N: expr) => { (0..$N).map(|_| scan.token::<$T>()).collect::>() }; } let N = input!(usize); let M = input!(usize); let A = input!(usize, M); let A = (0..M).map(|i| A[i] - 1).collect::>(); let mut pos = (0..N).collect::>(); let mut record = vec![pos.clone()]; for i in 0..M { let a = A[i]; (pos[a], pos[a + 1]) = (pos[a + 1], pos[a]); record.push(pos.clone()); // writeln!( // out, // "pos: {}", // pos.iter() // .map(|x| x.to_string()) // .collect::>() // .join(" ") // ); } let t = record[M][0]; let mut B = vec![]; for i in 1..N { // すべての記録で、最後に0に来るやつと i のプレゼントの距離が最も近いやつを計算すれば OK? let mut dist_min = usize::MAX; for r in record.iter() { let mut p0 = 0; let mut pi = 0; for j in 0..N { if r[j] == t { p0 = j; } if r[j] == i { pi = j; } } if dist_min > (p0 as isize - pi as isize).abs() as usize { dist_min = (p0 as isize - pi as isize).abs() as usize; } } B.push(dist_min); } writeln!( out, "{}", B.iter() .map(|x| x.to_string()) .collect::>() .join(" ") ); } struct Scanner { reader: R, buf_str: Vec, buf_iter: str::SplitWhitespace<'static>, } impl Scanner { fn new(reader: R) -> Self { Self { reader, buf_str: vec![], buf_iter: "".split_whitespace(), } } fn token(&mut self) -> T { loop { if let Some(token) = self.buf_iter.next() { return token.parse().ok().expect("Failed parse"); } self.buf_str.clear(); self.reader .read_until(b'\n', &mut self.buf_str) .expect("Failed read"); self.buf_iter = unsafe { let slice = str::from_utf8_unchecked(&self.buf_str); std::mem::transmute(slice.split_whitespace()) } } } }