-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathbooks.rs
59 lines (54 loc) · 1.4 KB
/
books.rs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
struct Scan {
buffer: std::collections::VecDeque<String>,
}
impl Scan {
fn new() -> Scan {
Scan {
buffer: std::collections::VecDeque::new(),
}
}
fn next<T: std::str::FromStr>(&mut self) -> T {
loop {
if let Some(token) = self.buffer.pop_front() {
break token.parse::<T>().ok().unwrap();
}
let mut line = String::new();
std::io::stdin().read_line(&mut line).expect("Fail to read");
self.buffer = line.split_whitespace().map(String::from).collect();
}
}
fn next_n<T: std::str::FromStr>(&mut self, n: usize) -> Vec<T> {
(0..n).map(|_| self.next::<T>()).collect()
}
}
fn _main() {
let mut scan = Scan::new();
let n: usize = scan.next();
let t: usize = scan.next();
let arr: Vec<usize> = scan.next_n(n);
let mut acc = 0usize;
let mut result = 0usize;
let mut left = 0usize;
let mut right = 0usize;
while right < n {
if acc > t {
acc -= arr[left];
left += 1;
} else {
acc += arr[right];
right += 1;
}
if acc <= t {
result = result.max(right - left);
}
}
println!("{}", result);
}
fn main() {
std::thread::Builder::new()
.stack_size(1 << 23)
.spawn(_main)
.unwrap()
.join()
.unwrap();
}