#589259 (Go) No.1199 お菓子配り-2

• 問題: No.1199 お菓子配り-2
• ユーザー: aru aru
• 提出日時: 2020-12-04 21:16:46
• 言語: Go (1.23.4)
• 結果: AC
• 実行時間: 206 ms / 1,000 ms
• コード長: 1,858 bytes
• コンパイル時間: 14,934 ms
• コンパイル使用メモリ: 218,772 KB
• 実行使用メモリ: 7,936 KB
• 最終ジャッジ日時: 2024-09-15 07:59:35
• 合計ジャッジ時間: 24,588 ms
• ジャッジサーバーID （参考情報）: judge4 / judge2

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

ソースコード

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
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
package main
import (
    "bufio"
    "fmt"
    "os"
    "sort"
    "strconv"
)
var sc = bufio.NewScanner(os.Stdin)
var wr = bufio.NewWriter(os.Stdout)
func out(x ...interface{}) {
    fmt.Fprintln(wr, x...)
}
func getI() int {
    sc.Scan()
    i, e := strconv.Atoi(sc.Text())
    if e != nil {
        panic(e)
    }
    return i
}
func getF() float64 {
    sc.Scan()
    i, e := strconv.ParseFloat(sc.Text(), 64)
    if e != nil {
        panic(e)
    }
    return i
}
func getInts(N int) []int {
    ret := make([]int, N)
    for i := 0; i < N; i++ {
        ret[i] = getI()
    }
    return ret
}
func getS() string {
    sc.Scan()
    return sc.Text()
}
// min, max, asub, absなど基本関数
func max(a, b int) int {
    if a > b {
        return a
    }
    return b
}
func min(a, b int) int {
    if a < b {
        return a
    }
    return b
}
func asub(a, b int) int {
    if a > b {
        return a - b
    }
    return b - a
}
func abs(a int) int {
    if a >= 0 {
        return a
    }
    return -a
}
func lowerBound(a []int, x int) int {
    idx := sort.Search(len(a), func(i int) bool {
        return a[i] >= x
    })
    return idx
}
func upperBound(a []int, x int) int {
    idx := sort.Search(len(a), func(i int) bool {
        return a[i] > x
    })
    return idx
}
func main() {
    defer wr.Flush()
    sc.Split(bufio.ScanWords)
    sc.Buffer([]byte{}, 1000000)
    // this template is new version.
    // use getI(), getS(), getInts(), getF()
    N, M := getI(), getI()
    a := make([]int, N)
    for i := 0; i < N; i++ {
        for j := 0; j < M; j++ {
            a[i] += getI()
        }
    }
    dp := make([][]int, N+1)
    for i := 0; i <= N; i++ {
        dp[i] = make([]int, N+1)
    }
    for i := 1; i <= N; i++ {
        for j := 1; j <= i; j++ {
            v := a[i-1]
            if j%2 == 0 {
                v = -v
            }
            if j != i {
                dp[i][j] = max(dp[i-1][j], dp[i-1][j-1]+v)
            } else {
                dp[i][j] = dp[i-1][j-1] + v
            }
            // out(i, j, dp[i][j], dp[i-1][j], dp[i-1][j-1], v)
        }
    }
    ma := 0
    for i := 0; i <= N; i++ {
        ma = max(ma, dp[N][i])
    }
    out(ma)
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX