-
Notifications
You must be signed in to change notification settings - Fork 0
/
kyu-1912.go
63 lines (59 loc) · 1.02 KB
/
kyu-1912.go
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
package main
import (
"bufio"
"fmt"
"os"
"strconv"
"strings"
)
func main() {
/*
https://www.acmicpc.net/problem/2739
O(n2) -> O(n)으로 풀기
*/
var n, rtn int
scanner := bufio.NewReader(os.Stdin)
_, _ = fmt.Scan(&n)
numbers := make([]int, n)
subSum := make([]int, n)
s, _ := scanner.ReadString('\n')
str := strings.Fields(s)
for i, s := range str {
numbers[i], _ = strconv.Atoi(s)
}
subSum[0] = numbers[0]
rtn = numbers[0]
for i := 1; i < n; i++ {
if subSum[i-1] > 0 {
subSum[i] = numbers[i] + subSum[i-1]
} else {
subSum[i] = numbers[i]
}
if subSum[i] > rtn {
rtn = subSum[i]
}
}
fmt.Println(rtn)
}
//
//func main() {
// var n ,rtn int
// _,_ = fmt.Scan(&n)
// numbers := make([]int,n)
// for i:=0;i<n;i++ {
// _,_ =fmt.Scan(&numbers[i])
// if i!=0{
// numbers[i] = numbers[i-1]+numbers[i]
// }
// if rtn< numbers[i]{
// rtn = numbers[i]
// }
// for k:=0;k<i;k++{
// if rtn < numbers[i]-numbers[k] {
// rtn = numbers[i]-numbers[k]
// }
// }
// }
//
// fmt.Println(rtn)
//}