Moon landing

#![allow(unused)]

use std::{collections::linked_list, io};

fn take_tuple() -> (usize, usize) {
    let mut input = String::new();
    io::stdin().read_line(&mut input).unwrap();
    let mut it = input
        .trim()
        .split_whitespace()
        .map(|x| x.parse::<usize>().unwrap());
    (it.next().unwrap(), it.next().unwrap())
}
fn take_vector() -> Vec<usize> {
    let mut input = String::new();
    io::stdin().read_line(&mut input).unwrap();
    let arr: Vec<usize> = input
        .trim()
        .split_whitespace()
        .map(|x| x.parse::<usize>().unwrap())
        .collect();
    return arr;
}

fn find(x: &usize, link: &Vec<usize>) -> usize {
    let mut y: usize = link[*x];

    while y != link[y] {
        y = link[y]
    }
    y
}

fn same(a: &usize, b: &usize, link: &Vec<usize>) -> bool {
    return find(a, link) == find(b, link);
}

fn main() {
    let (n, x): (usize, usize) = take_tuple();
    let mut strip: Vec<usize> = take_vector();
    let mut link: Vec<(usize, usize)> = Vec::with_capacity(n);
    let mut size: Vec<(usize, usize)> = Vec::with_capacity(n);

    for i in 0..n {
        link.push((i, strip[i]));
        size.push((i, 1));
    }
    // println!("{:?}", link);

    let mut max_size: usize = 1;
    let mut c_max_chain_start = 0;

    let mut size: usize = 1;
    let mut c_chain_start = 0;
    let mut c_chain_min: usize = link[0].1;
    let mut c_chain_max: usize = link[0].1;
    for i in 1..n {
        // print!("looking at item {}, height {}", i, link[i].1);

        if link[i].1 > c_chain_min + x {
            // println!(" starting new chain too big");
            // start new
            if size >= max_size {
                // new best
                max_size = size;
                c_max_chain_start = c_chain_start;
            }
            c_max_chain_start = i;
            size = 1;
            c_chain_max = link[i].1;
            c_chain_min = link[i].1;
            continue;
        } else if link[i].1 + x < c_chain_max {
            // println!(" starting new chain to small");
            // start new
            if size >= max_size {
                // new best
                max_size = size;
                c_max_chain_start = c_chain_start;
            }
            c_max_chain_start = i;
            size = 1;
            c_chain_max = link[i].1;
            c_chain_min = link[i].1;
            continue;
        }
        // println!(" adding to chain");

        // next meter fits into the chain
        size += 1;
        c_chain_max = usize::max(c_chain_max, link[i].1);
        c_chain_min = usize::min(c_chain_min, link[i].1);
    }
    max_size = usize::max(max_size, size);

    println!("{} {}", c_chain_start + 1, max_size)
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: WRONG ANSWER

Test 14

Verdict: ACCEPTED

Test 15

Verdict: WRONG ANSWER

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: WRONG ANSWER

Test 19

Verdict: WRONG ANSWER

Test 20

Verdict: ACCEPTED

Test 21

Verdict: ACCEPTED

Test 22

Verdict: WRONG ANSWER

Test 23

Verdict: WRONG ANSWER

Test 24

Verdict: ACCEPTED

Test 25

Verdict: WRONG ANSWER

Test 26

Verdict: WRONG ANSWER

Test 27

Verdict: ACCEPTED

Test 28

Verdict: WRONG ANSWER

Test 29

Verdict: WRONG ANSWER

Test 30

Verdict: ACCEPTED

Test 31

Verdict: WRONG ANSWER

Test 32

Verdict: WRONG ANSWER

Test 33

Verdict: WRONG ANSWER

Test 34

Verdict: WRONG ANSWER

Test 35

Verdict: WRONG ANSWER

Test 36

Verdict: ACCEPTED

Test 37

Verdict: WRONG ANSWER

Test 38

Verdict: WRONG ANSWER

Test 39

Verdict: WRONG ANSWER

Test 40

Verdict: WRONG ANSWER

Test 41

Verdict: WRONG ANSWER

Test 42

Verdict: WRONG ANSWER

Test 43

Verdict: WRONG ANSWER

Test 44

Verdict: WRONG ANSWER

Test 45

Verdict: WRONG ANSWER

Test 46

Verdict: ACCEPTED

Test 47

Verdict: WRONG ANSWER

Test 48

Verdict: WRONG ANSWER

Test 49

Verdict: WRONG ANSWER

Test 50

Verdict: WRONG ANSWER

Test 51

Verdict: WRONG ANSWER

Test 52

Verdict: WRONG ANSWER

Test 53

Verdict: WRONG ANSWER

Test 54

Verdict: WRONG ANSWER

Test 55

Verdict: WRONG ANSWER

Test 56

Verdict: WRONG ANSWER

Test 57

Verdict: WRONG ANSWER

Test 58

Verdict: WRONG ANSWER

Test 59

Verdict: WRONG ANSWER

Test 60

Verdict: WRONG ANSWER

Test 61

Verdict: WRONG ANSWER

Test 62

Verdict: WRONG ANSWER

Test 63

Verdict: WRONG ANSWER

Test 64

Verdict: ACCEPTED