#704436 (Rust) No.1117 数列分割

• 問題: No.1117 数列分割
• ユーザー: koba-e964
• 提出日時: 2021-10-03 16:26:36
• 言語: Rust (1.83.0 + proconio)
• 結果: AC
• 実行時間: 233 ms / 3,000 ms
• コード長: 2,678 bytes
• コンパイル時間: 12,984 ms
• コンパイル使用メモリ: 400,704 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-07-21 10:42:09
• 合計ジャッジ時間: 16,679 ms
• ジャッジサーバーID （参考情報）: judge5 / judge4

ファイルパターン	結果
sample	AC * 3
other	AC * 26

ソースコード

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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
use std::collections::*;
use std::cmp::*;
// https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String{
            bytes.by_ref().map(|r|r.unwrap() as char)
                .skip_while(|c|c.is_whitespace())
                .take_while(|c|!c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}
macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr,) => {};
    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}
macro_rules! read_value {
    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };
    ($next:expr, $t:ty) => ($next().parse::<$t>().expect("Parse error"));
}
trait Change { fn chmax(&mut self, x: Self); fn chmin(&mut self, x: Self); }
impl<T: PartialOrd> Change for T {
    fn chmax(&mut self, x: T) { if *self < x { *self = x; } }
    fn chmin(&mut self, x: T) { if *self > x { *self = x; } }
}
const INF: i64 = 1 << 50;
fn prog(n: usize, acc: &[i64], m: usize, dp: &[i64], ep: &mut [i64]) {
    let mut st = VecDeque::new();
    st.push_back((0, dp[0]));
    for i in 1..n + 1 {
        let pre = st[0];
        ep[i] = pre.1 + acc[i];
        if pre.0 + m <= i {
            st.pop_front();
        }
        while let Some(v) = st.pop_back() {
            if v.1 <= dp[i] - acc[i] {
                continue;
            }
            st.push_back(v);
            break;
        }
        st.push_back((i, dp[i] - acc[i]));
    }
    let mut st = VecDeque::new();
    st.push_back((0, dp[0]));
    for i in 1..n + 1 {
        let pre = st[0];
        ep[i].chmax(pre.1 - acc[i]);
        if pre.0 + m <= i {
            st.pop_front();
        }
        while let Some(v) = st.pop_back() {
            if v.1 <= dp[i] + acc[i] {
                continue;
            }
            st.push_back(v);
            break;
        }
        st.push_back((i, dp[i] + acc[i]));
    }
}
// Tags: sliding-window-technique
fn main() {
    // Lagrange relaxation seems not to work.
    input! {
        n: usize, k: usize, m: usize,
        a: [i64; n],
    }
    let mut acc = vec![0; n + 1];
    for i in 0..n {
        acc[i + 1] = acc[i] + a[i];
    }
    let mut dp = vec![-INF; n + 1];
    dp[0] = 0;
    for _ in 0..k {
        let mut ep = vec![-INF; n + 1];
        prog(n, &acc, m, &dp, &mut ep);
        dp = ep;
    }
    println!("{}", dp[n]);
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX