結果

問題 No.489 株に挑戦
ユーザー hatoohatoo
提出日時 2017-10-18 01:08:57
言語 Rust
(1.77.0)
結果
AC  
実行時間 52 ms / 1,000 ms
コード長 4,325 bytes
コンパイル時間 1,126 ms
コンパイル使用メモリ 150,372 KB
実行使用メモリ 18,356 KB
最終ジャッジ日時 2023-09-27 05:50:15
合計ジャッジ時間 3,418 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 39 ms
18,056 KB
testcase_01 AC 27 ms
17,784 KB
testcase_02 AC 5 ms
17,496 KB
testcase_03 AC 5 ms
17,564 KB
testcase_04 AC 5 ms
17,500 KB
testcase_05 AC 5 ms
17,576 KB
testcase_06 AC 6 ms
17,552 KB
testcase_07 AC 5 ms
17,600 KB
testcase_08 AC 6 ms
17,568 KB
testcase_09 AC 5 ms
17,456 KB
testcase_10 AC 5 ms
17,608 KB
testcase_11 AC 4 ms
17,536 KB
testcase_12 AC 5 ms
17,568 KB
testcase_13 AC 6 ms
17,540 KB
testcase_14 AC 5 ms
17,528 KB
testcase_15 AC 8 ms
17,552 KB
testcase_16 AC 46 ms
18,016 KB
testcase_17 AC 9 ms
17,560 KB
testcase_18 AC 25 ms
17,840 KB
testcase_19 AC 21 ms
17,816 KB
testcase_20 AC 46 ms
18,056 KB
testcase_21 AC 14 ms
17,564 KB
testcase_22 AC 8 ms
17,532 KB
testcase_23 AC 26 ms
17,848 KB
testcase_24 AC 50 ms
18,344 KB
testcase_25 AC 5 ms
17,568 KB
testcase_26 AC 48 ms
18,356 KB
testcase_27 AC 49 ms
18,328 KB
testcase_28 AC 6 ms
17,568 KB
testcase_29 AC 5 ms
17,612 KB
testcase_30 AC 49 ms
18,344 KB
testcase_31 AC 52 ms
18,324 KB
testcase_32 AC 28 ms
17,840 KB
testcase_33 AC 50 ms
18,316 KB
testcase_34 AC 45 ms
18,088 KB
testcase_35 AC 20 ms
17,800 KB
testcase_36 AC 11 ms
17,636 KB
testcase_37 AC 30 ms
17,828 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

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)
    }
}

#[derive(Eq, PartialEq, Clone)]
struct Rev<T>(pub T);

impl<T: PartialOrd> PartialOrd for Rev<T> {
    fn partial_cmp(&self, other: &Rev<T>) -> Option<Ordering> {
        other.0.partial_cmp(&self.0)
    }
}

impl<T: Ord> Ord for Rev<T> {
    fn cmp(&self, other: &Rev<T>) -> Ordering {
        other.0.cmp(&self.0)
    }
}

struct SEG {
    n: usize,
    buf: Vec<(u64, Rev<usize>)>,
}

impl SEG {
    fn new(n: usize) -> SEG {
        let n = (1..).find(|&d| 2usize.pow(d) > n).unwrap();
        SEG {
            n: 2usize.pow(n),
            buf: vec![(0, Rev(0)); 1000000],
        }
    }

    fn update(&mut self, k: usize, a: (u64, Rev<usize>)) {
        let mut k = k + self.n - 1;
        self.buf[k] = a;

        while k > 0 {
            k = (k - 1) / 2;
            self.buf[k] = max(self.buf[k * 2 + 1].clone(), self.buf[k * 2 + 2].clone());
        }
    }

    fn query(&self, a: usize, b: usize, k: usize, l: usize, r: usize) -> (u64, Rev<usize>) {
        if r <= a || b <= l {
            return (0, Rev(0));
        }

        if a <= l && r <= b {
            self.buf[k].clone()
        } else {
            let vl = self.query(a, b, k * 2 + 1, l, (l + r) / 2);
            let vr = self.query(a, b, k * 2 + 2, (l + r) / 2, r);
            max(vl, vr)
        }
    }

    fn q(&self, a: usize, b: usize) -> (u64, Rev<usize>) {
        self.query(a, b, 0, 0, self.n)
    }
}

/* Can't
impl<T: Clone> Clone for Reverse<T> {
    fn clone(&self) -> Reverse<T> {
        Reverse(self.0.clone())
    }
}
*/

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

    let mut seg = SEG::new(n);

    for (i, &x) in xs.iter().enumerate() {
        seg.update(i, (x, Rev(i)));
    }

    let ans = (0..n - 1)
        .filter_map(|i| {
            let r = min(i + 1 + d, n);
            let (maximum, rev) = seg.q(i + 1, r);
            if maximum > xs[i] {
                Some((maximum - xs[i], Rev((i, rev.0))))
            } else {
                None
            }
        })
        .max();

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