Submission #1384166

---

Source Code Expand

use std::io;
use std::cmp::max;
use std::collections::VecDeque;

fn main() {
    let mut input = Input::new();
    let n: usize = input.next();
    let k: usize = input.next();
    let a: Vec<i64> = (0..n).map(|_| input.next()).collect();
    let mut s: i64 = 0;
    let mut nm: i64 = 0;
    let mut bm: i64 = i64::min_value();
    let mut np: i64 = 0;
    let mut bp: i64 = i64::max_value();
    for i in 0..n {
        if a[i] > 0 {
            s += a[i];
            np += a[i];
        } else {
            nm += a[i];
        }
        if i >= k {
            if a[i - k] > 0 {
                np -= a[i - k];
            } else {
                nm -= a[i - k];
            }
        }
        if i + 2 > k {
            if bm < nm {
                bm = nm;
            }
            if bp > np {
                bp = np;
            }
        }
    }
    println!("{}", max(s + bm, s - bp));
}

struct Input {
    queue: VecDeque<String>,
}

impl Input {
    fn new() -> Input {
        Input { queue: VecDeque::new() }
    }

    fn next<T>(&mut self) -> T
        where T: std::str::FromStr,
              T::Err: std::fmt::Debug
    {
        if self.queue.is_empty() {
            let mut line = String::new();
            let _ = io::stdin().read_line(&mut line);
            for x in line.split_whitespace() {
                self.queue.push_back(String::from(x));
            }
        }
        return self.queue.pop_front().unwrap().parse::<T>().unwrap();
    }
}

Submission Info

Judge Result