#210466 (Rust) No.489 株に挑戦

• 問題: No.489 株に挑戦
• ユーザー: hatoo
• 提出日時: 2017-10-18 02:20:13
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 12 ms / 1,000 ms
• コード長: 3,213 bytes
• コンパイル時間: 16,286 ms
• コンパイル使用メモリ: 377,820 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-07-19 23:56:24
• 合計ジャッジ時間: 17,803 ms
• ジャッジサーバーID （参考情報）: judge3 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	10 ms; 5,248 KB
testcase_01	AC	7 ms; 5,248 KB
testcase_02	AC	1 ms; 5,376 KB
testcase_03	AC	1 ms; 5,376 KB
testcase_04	AC	1 ms; 5,376 KB
testcase_05	AC	1 ms; 5,376 KB
testcase_06	AC	1 ms; 5,376 KB
testcase_07	AC	1 ms; 5,376 KB
testcase_08	AC	1 ms; 5,376 KB
testcase_09	AC	1 ms; 5,376 KB
testcase_10	AC	1 ms; 5,376 KB
testcase_11	AC	1 ms; 5,376 KB
testcase_12	AC	1 ms; 5,376 KB
testcase_13	AC	1 ms; 5,376 KB
testcase_14	AC	1 ms; 5,376 KB
testcase_15	AC	1 ms; 5,376 KB
testcase_16	AC	11 ms; 5,376 KB
testcase_17	AC	2 ms; 5,376 KB
testcase_18	AC	6 ms; 5,376 KB
testcase_19	AC	5 ms; 5,376 KB
testcase_20	AC	10 ms; 5,376 KB
testcase_21	AC	3 ms; 5,376 KB
testcase_22	AC	2 ms; 5,376 KB
testcase_23	AC	7 ms; 5,376 KB
testcase_24	AC	12 ms; 5,376 KB
testcase_25	AC	1 ms; 5,376 KB
testcase_26	AC	11 ms; 5,376 KB
testcase_27	AC	10 ms; 5,376 KB
testcase_28	AC	1 ms; 5,376 KB
testcase_29	AC	1 ms; 5,376 KB
testcase_30	AC	12 ms; 5,376 KB
testcase_31	AC	10 ms; 5,376 KB
testcase_32	AC	6 ms; 5,376 KB
testcase_33	AC	11 ms; 5,376 KB
testcase_34	AC	10 ms; 5,376 KB
testcase_35	AC	4 ms; 5,376 KB
testcase_36	AC	2 ms; 5,376 KB
testcase_37	AC	6 ms; 5,376 KB

ソースコード

#[allow(unused_imports)]
use std::cmp::{max, min, Ordering, Reverse};
#[allow(unused_imports)]
use std::collections::{HashMap, HashSet, VecDeque};

mod util {
    use std::io::stdin;
    use std::str::FromStr;
    use std::fmt::Debug;

    #[allow(dead_code)]
    pub fn line() -> String {
        let mut line: String = String::new();
        stdin().read_line(&mut line).unwrap();
        line.trim().to_string()
    }

    #[allow(dead_code)]
    pub fn get<T: FromStr>() -> T
    where
        <T as FromStr>::Err: Debug,
    {
        let mut line: String = String::new();
        stdin().read_line(&mut line).unwrap();
        line.trim().parse().unwrap()
    }

    #[allow(dead_code)]
    pub fn gets<T: FromStr>() -> Vec<T>
    where
        <T as FromStr>::Err: Debug,
    {
        let mut line: String = String::new();
        stdin().read_line(&mut line).unwrap();
        line.split_whitespace()
            .map(|t| t.parse().unwrap())
            .collect()
    }

    #[allow(dead_code)]
    pub fn get2<T: FromStr, U: FromStr>() -> (T, U)
    where
        <T as FromStr>::Err: Debug,
        <U as FromStr>::Err: Debug,
    {
        let mut line: String = String::new();
        stdin().read_line(&mut line).unwrap();
        let mut iter = line.split_whitespace();
        (
            iter.next().unwrap().parse().unwrap(),
            iter.next().unwrap().parse().unwrap(),
        )
    }

    #[allow(dead_code)]
    pub fn get3<S: FromStr, T: FromStr, U: FromStr>() -> (S, T, U)
    where
        <S as FromStr>::Err: Debug,
        <T as FromStr>::Err: Debug,
        <U as FromStr>::Err: Debug,
    {
        let mut line: String = String::new();
        stdin().read_line(&mut line).unwrap();
        let mut iter = line.split_whitespace();
        (
            iter.next().unwrap().parse().unwrap(),
            iter.next().unwrap().parse().unwrap(),
            iter.next().unwrap().parse().unwrap(),
        )
    }
}


#[allow(unused_macros)]
macro_rules! debug {
    ($x: expr) => {
        println!("{}: {:?}", stringify!($x), $x)
    }
}

fn main() {
    let (n, d, k): (usize, usize, u64) = util::get3();
    let xs: Vec<u64> = (0..n).map(|_| util::get()).collect();

    let mut deq = VecDeque::new();
    let mut r = 0;

    for _ in 0..d {
        while !deq.is_empty() && xs[deq.back().cloned().unwrap()] < xs[r] {
            deq.pop_back();
        }
        deq.push_back(r);
        r += 1;
    }

    let ans = (0..n - 1)
        .filter_map(|i| {
            if r < n {
                while !deq.is_empty() && xs[deq.back().cloned().unwrap()] < xs[r] {
                    deq.pop_back();
                }
                deq.push_back(r);
                r += 1;
            }

            while deq.front().map(|&k| k <= i) == Some(true) {
                deq.pop_front();
            }

            deq.front().and_then(|&k| if xs[k] > xs[i] {
                Some((xs[k] - xs[i], Reverse((i, k))))
            } else {
                None
            })
        })
        .max();


    if let Some((profit, Reverse((buy, sell)))) = ans {
        println!("{}", profit * k);
        println!("{} {}", buy, sell);
    } else {
        println!("0");
    }
}