#![allow(unused_imports)] #![allow(dead_code)] #![allow(non_camel_case_types)] #![allow(non_snake_case)] use std::cmp::*; use std::collections::*; use std::ops::*; use std::io::{Write, BufWriter}; const MOD: usize = 998244353; // https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8 macro_rules! input { ($($r:tt)*) => { let stdin = std::io::stdin(); let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock())); let mut next = move || -> String{ bytes .by_ref() .map(|r|r.unwrap() as char) .skip_while(|c|c.is_whitespace()) .take_while(|c|!c.is_whitespace()) .collect() }; input_inner!{next, $($r)*} }; } macro_rules! input_inner { ($next:expr) => {}; ($next:expr, ) => {}; ($next:expr, $var:ident : $t:tt $($r:tt)*) => { let $var = read_value!($next, $t); input_inner!{$next $($r)*} }; } macro_rules! read_value { ($next:expr, ( $($t:tt),* )) => { ( $(read_value!($next, $t)),* ) }; ($next:expr, [ $t:tt ; $len:expr ]) => { (0..$len).map(|_| read_value!($next, $t)).collect::>() }; ($next:expr, chars) => { read_value!($next, String).chars().collect::>() }; ($next:expr, usize1) => { read_value!($next, usize) - 1 }; ($next:expr, [ $t:tt ]) => {{ let len = read_value!($next, usize); (0..len).map(|_| read_value!($next, $t)).collect::>() }}; ($next:expr, $t:ty) => { $next().parse::<$t>().expect("Parse error") }; } fn solve() { input! { n: usize, a: [i64; n], q: usize, b: [[usize;2];q], } let mut zero = vec![0;n]; let mut up = vec![0;n]; let mut down = vec![0;n]; for i in 0..n-1 { if a[i+1] == a[i] { zero[i+1] = 1; } if a[i+1] > a[i] { up[i+1] = 1; } if a[i+1] < a[i] { down[i+1] = 1; } zero[i+1] += zero[i]; up[i+1] += up[i]; down[i+1] += down[i]; } for i in 0..q { let l = b[i][0]; let r = b[i][1]; let z = zero[r] - zero[l]; let u = up[r] - up[l]; let d = down[r] - down[l]; let mut ans1 = 0; let mut ans2 = 0; if z+d==r-l{ ans1 = 1; } if z+u==r-l{ ans2 = 1; } println!("{} {}", ans2, ans1); } } fn main() { // In order to avoid potential stack overflow, spawn a new thread. let stack_size = 104_857_600; // 100 MB let thd = std::thread::Builder::new().stack_size(stack_size); thd.spawn(|| solve()).unwrap().join().unwrap(); }