// ---------- begin chmin, chmax ---------- pub trait ChangeMinMax { fn chmin(&mut self, x: Self) -> bool; fn chmax(&mut self, x: Self) -> bool; } impl ChangeMinMax for T { fn chmin(&mut self, x: Self) -> bool { *self > x && { *self = x; true } } fn chmax(&mut self, x: Self) -> bool { *self < x && { *self = x; true } } } // ---------- end chmin, chmax ---------- // ---------- begin input macro ---------- // reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8 macro_rules! input { (source = $s:expr, $($r:tt)*) => { let mut iter = $s.split_whitespace(); input_inner!{iter, $($r)*} }; ($($r:tt)*) => { let s = { use std::io::Read; let mut s = String::new(); std::io::stdin().read_to_string(&mut s).unwrap(); s }; let mut iter = s.split_whitespace(); input_inner!{iter, $($r)*} }; } macro_rules! input_inner { ($iter:expr) => {}; ($iter:expr, ) => {}; ($iter:expr, $var:ident : $t:tt $($r:tt)*) => { let $var = read_value!($iter, $t); input_inner!{$iter $($r)*} }; } macro_rules! read_value { ($iter:expr, ( $($t:tt),* )) => { ( $(read_value!($iter, $t)),* ) }; ($iter:expr, [ $t:tt ; $len:expr ]) => { (0..$len).map(|_| read_value!($iter, $t)).collect::>() }; ($iter:expr, chars) => { read_value!($iter, String).chars().collect::>() }; ($iter:expr, bytes) => { read_value!($iter, String).bytes().collect::>() }; ($iter:expr, usize1) => { read_value!($iter, usize) - 1 }; ($iter:expr, $t:ty) => { $iter.next().unwrap().parse::<$t>().expect("Parse error") }; } // ---------- end input macro ---------- fn run() { input! { n: usize, k: usize, a: [i64; n], } let inf = 10000 * 300 * 300 * 2i64; let mut dp = vec![vec![vec![(-inf, -inf); n]; n]; k + 1]; for (i, a) in a.iter().enumerate() { let v = *a * k as i64; dp[k][i][i] = (v, v); } let mut left = vec![vec![-inf; n]; n]; let mut right = vec![vec![-inf; n]; n]; for i in (0..=k).rev() { for l in 0..n { for r in l..n { let p = dp[i][l][r]; if p.0 == -inf { continue; } if l < r && i >= 2 { dp[i - 2][l][r].0.chmax(p.0); dp[i - 2][l][r].1.chmax(p.1); } if l < r { if i % 2 == 0 { left[l][r.min(l + i)].chmax(p.0); right[r][l.max(r.saturating_sub(i))].chmax(p.1); } else { if l + 1 < n { left[l + 1][r.min(l + i)].chmax(p.0); } if r > 0 { right[r - 1][l.max(r.saturating_sub(i))].chmax(p.1); } } } if i >= r - l { let x = i - (r - l); dp[x][l][r].1.chmax(p.0); dp[x][l][r].0.chmax(p.1); } if l > 0 && i > 0 { let x = i - 1; dp[x][l - 1][r].0.chmax(p.0 + x as i64 * a[l - 1]); } if r + 1 < n && i > 0 { let x = i - 1; dp[x][l][r + 1].1.chmax(p.1 + x as i64 * a[r + 1]); } } } } let mut ans = vec![-inf; n]; for (l, left) in left.iter().enumerate() { for (r, v) in left.iter().enumerate() { for i in (l..=r).step_by(2) { ans[i].chmax(*v); } } } for (r, right) in right.iter().enumerate() { for (l, v) in right.iter().enumerate() { for i in (l..=r).rev().step_by(2) { ans[i].chmax(*v); } } } for a in ans { println!("{}", a); } } fn main() { run(); }