Commit 4fa7a54

committed

issue #45 연속합 1912

1 parent cfcc9a6 commit 4fa7a54Copy full SHA for 4fa7a54

File tree

+36

-0

lines changed

+36

-0

lines changed

Lines changed: 36 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,36 @@`
	`1`	`+package backjoon;`
	`2`	`+// https://www.acmicpc.net/problem/1912`
	`3`	`+`
	`4`	`+import java.io.BufferedReader;`
	`5`	`+import java.io.IOException;`
	`6`	`+import java.io.InputStreamReader;`
	`7`	`+import java.util.StringTokenizer;`
	`8`	`+`
	`9`	`+public class _1912 {`
	`10`	`+ public static void main(String[] args) throws IOException {`
	`11`	`+`
	`12`	`+ BufferedReader br = new BufferedReader(new InputStreamReader(System.in));`
	`13`	`+ int N = Integer.parseInt(br.readLine());`
	`14`	`+`
	`15`	`+ int[] numbers = new int[N];`
	`16`	`+ int[] dp = new int[N]; //누적합을 저장하는 배열 dp[2]면 dp[0]~dp[2]까지 누적합`
	`17`	`+`
	`18`	`+ StringTokenizer st = new StringTokenizer(br.readLine(), " ");`
	`19`	`+`
	`20`	`+ // numbers배열에 input 숫자들 담기`
	`21`	`+ for(int i=0; i<N; i++){`
	`22`	`+ numbers[i] = Integer.parseInt(st.nextToken());`
	`23`	`+ }`
	`24`	`+`
	`25`	`+ // 초기화`
	`26`	`+ dp[0] = numbers[0];`
	`27`	`+ int max = numbers[0];`
	`28`	`+`
	`29`	`+ for(int i=1; i<N; i++){`
	`30`	`+ dp[i] = Math.max(dp[i-1]+numbers[i], numbers[i]);`
	`31`	`+ // 최댓값 갱신`
	`32`	`+ max = Math.max(max, dp[i]);`
	`33`	`+ }`
	`34`	`+ System.out.println(max);`
	`35`	`+ }`
	`36`	`+}`

Comments

(0)