//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, usize1) => { read_value!($iter, usize) - 1 }; ($iter:expr, $t:ty) => { $iter.next().unwrap().parse::<$t>().expect("Parse error") }; } // fn run() { input! { w: usize, p: [(i64, i64, i64); w], } let mid = (w + 1) / 2; let (front, back) = p.split_at(mid); let mut dp = vec![vec![]; 3];// 最後の行動が学校、アルバイト、デート dp[2].push((0, 0)); for &(a, b, c) in front.iter() { let mut next = vec![vec![]; 3]; for &(p, f) in dp[0].iter() { next[2].push((p - c, f + b)); } for &(p, f) in dp[1].iter() { next[0].push((p, f)); next[1].push((p + a, f)); } for &(p, f) in dp[2].iter() { next[0].push((p, f)); next[1].push((p + a, f)); } for next in next.iter_mut() { next.sort(); let mut a: Vec<(i64, i64)> = vec![]; for &(p, f) in next.iter() { if let Some(&(q, g)) = a.last() { if q <= p && g <= f { a.pop(); } } a.push((p, f)); } *next = a; } dp = next; } let front_res = dp; let mut dp = vec![vec![]; 3];// 最初の行動が学校、アルバイト、デート dp[1].push((0, 0)); dp[2].push((0, 0)); for &(a, b, c) in back.iter().rev() { let mut next = vec![vec![]; 3]; for &(p, f) in dp[0].iter() { next[1].push((p + a, f)); next[2].push((p - c, f + b)); } for &(p, f) in dp[1].iter() { next[1].push((p + a, f)); next[2].push((p - c, f + b)); } for &(p, f) in dp[2].iter() { next[0].push((p, f)); } for next in next.iter_mut() { next.sort(); let mut a: Vec<(i64, i64)> = vec![]; for &(p, f) in next.iter() { if let Some(&(q, g)) = a.last() { if q <= p && g <= f { a.pop(); } } a.push((p, f)); } *next = a; } dp = next; } let back_res = dp; let mut ans = 0; for (i, f) in front_res.iter().enumerate() { for (j, b) in back_res.iter().enumerate() { if i == 0 && j != 2 { continue; } if i != 0 && j == 2 { continue; } for &(a, x) in f.iter() { for &(b, y) in b.iter() { if a + b >= 0 { ans = std::cmp::max(ans, x + y); } } } } } println!("{}", ans); } fn main() { run(); }