fn main() { input!{ n: usize, x: usize, a: [usize; n], } let mut aa = a.clone(); for i in 0..n { aa.push(a[i]);} let mut acc_aa = vec![0; 2*n+1]; for i in 0..2*n { acc_aa[i+1] = acc_aa[i] + aa[i]; } let mut ans = 0; for i in 0..n { // +xを超えるひとつ前、n個を超えないを取得 let mut pos = lower_bound(&acc_aa, acc_aa[i]+x+1)-1; pos = min(pos, i+n-1); dbg!(pos); ans = max(ans, acc_aa[pos] - acc_aa[i]); dbg!(acc_aa[pos], acc_aa[i]); } println!("{}", ans); // 二分探索 pub fn lower_bound(vec: &Vec, val: T) -> usize { let mut l = 0; let mut r = vec.len(); while r - l > 0 { let m = (l + r) / 2; if vec[m] < val { l = m + 1; } else { r = m; } } l } } // ---------- begin input macro ---------- #[macro_export] 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_export] 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_export] 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 ---------- #[allow(unused)] use std::{ io::stderr, io::stdin, io::BufRead, io::Write, mem::swap, cmp::min, cmp::max, cmp::Reverse, collections::HashSet, collections::BTreeSet, collections::HashMap, collections::BTreeMap, collections::BinaryHeap, collections::VecDeque, };