Submission #1371405

---

Source Code Expand

use std::io;
use std::collections::VecDeque;

fn main() {
    let mut input = Input::new();
    let n: usize = input.next();
    let x: i64 = input.next();
    let mut a: Vec<i64> = vec![0;n];
    for i in 0..n {
        a[i] = input.next();
    }
    let mut t: Vec<i64> = vec![i64::max_value();n];
    let mut v = i64::max_value();
    for i in 0..n {
        let mut s: i64 = 0;
        for j in 0..n {
            let k = if j < i { a[n + j - i] } else { a[j - i] };
            if t[j] > k {
                t[j] = k;
            }
            s += t[j];
        }
        if v > s + i as i64 * x {
            v = s + i as i64 * x;
        }
    }
    println!("{}", v);
}

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