結果
問題 | No.489 株に挑戦 |
ユーザー |
![]() |
提出日時 | 2020-04-23 19:01:42 |
言語 | Rust (1.83.0 + proconio) |
結果 |
AC
|
実行時間 | 10 ms / 1,000 ms |
コード長 | 4,675 bytes |
コンパイル時間 | 13,020 ms |
コンパイル使用メモリ | 402,472 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-07-20 00:20:19 |
合計ジャッジ時間 | 14,769 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 35 |
ソースコード
#![allow(unused)]use kyoproio::*;use std::{collections::*,io::{self, prelude::*},iter,mem::{replace, swap},};fn main() -> io::Result<()> {std::thread::Builder::new().stack_size(64 * 1024 * 1024).spawn(solve)?.join().unwrap();Ok(())}fn solve() {let stdin = io::stdin();let mut kin = KInput::new(stdin.lock());let stdout = io::stdout();let mut out = io::BufWriter::new(stdout.lock());macro_rules! output { ($($args:tt),+) => { write!(&mut out, $($args),+) }; }macro_rules! outputln {($($args:tt),+) => { output!($($args),+); outputln!(); };() => { output!("\n"); if cfg!(debug_assertions) { out.flush(); } }}let (n, d, k): (usize, usize, i64) = kin.input();let a: Vec<i64> = kin.seq(n);let mut que = VecDeque::new();let mut ans = 0;let mut f = 0;let mut t = 0;for i in 0..n {let x: i64 = a[i];if let Some(&(y, j)) = que.front() {let v = k * (x - y);if v > ans {ans = v;f = j;t = i;}}if let Some(j) = i.checked_sub(d) {if que.front() == Some(&(a[j], j)) {que.pop_front();}}while let Some(&(y, j)) = que.back() {if y <= x {break;}que.pop_back();}que.push_back((x, i));// eprintln!("{:?}", &que);}if ans == 0 {outputln!("0");} else {outputln!("{}\n{} {}", ans, f, t);}}// -----------------------------------------------------------------------------pub mod kyoproio {#![warn(unused)]use std::io::prelude::*;pub trait Input {fn str(&mut self) -> &str;fn input<T: InputParse>(&mut self) -> T {T::input(self)}fn iter<T: InputParse>(&mut self) -> Iter<T, Self> {Iter(self, std::marker::PhantomData)}fn seq<T: InputParse, B: std::iter::FromIterator<T>>(&mut self, n: usize) -> B {self.iter().take(n).collect()}}pub struct KInput<R> {src: R,buf: String,pos: usize,}impl<R: BufRead> KInput<R> {pub fn new(src: R) -> Self {Self {src,buf: String::with_capacity(1024),pos: 0,}}}impl<R: BufRead> Input for KInput<R> {fn str(&mut self) -> &str {loop {if self.pos >= self.buf.len() {self.pos = 0;self.buf.clear();if self.src.read_line(&mut self.buf).expect("io error") == 0 {return &self.buf;}}let range = self.pos..self.buf[self.pos..].find(|c: char| c.is_ascii_whitespace()).map(|i| i + self.pos).unwrap_or_else(|| self.buf.len());self.pos = range.end + 1;if range.end > range.start {return &self.buf[range];}}}}pub struct Iter<'a, T, I: ?Sized>(&'a mut I, std::marker::PhantomData<*const T>);impl<'a, T: InputParse, I: Input + ?Sized> Iterator for Iter<'a, T, I> {type Item = T;fn next(&mut self) -> Option<T> {Some(self.0.input())}}pub trait InputParse: Sized {fn input<I: Input + ?Sized>(input: &mut I) -> Self;}impl InputParse for Vec<u8> {fn input<I: Input + ?Sized>(input: &mut I) -> Self {input.str().as_bytes().to_owned()}}macro_rules! from_str_impl {{ $($T:ty)* } => {$(impl InputParse for $T {fn input<I: Input + ?Sized>(input: &mut I) -> Self {input.str().parse::<$T>().expect("parse error")}})*}}from_str_impl! {String char bool f32 f64 isize i8 i16 i32 i64 i128 usize u8 u16 u32 u64 u128}macro_rules! tuple_impl {($H:ident $($T:ident)*) => {impl<$H: InputParse, $($T: InputParse),*> InputParse for ($H, $($T),*) {fn input<I: Input + ?Sized>(input: &mut I) -> Self {($H::input(input), $($T::input(input)),*)}}tuple_impl!($($T)*);};() => {}}tuple_impl!(A B C D E F G);}