[BOJ] 백준 10211 Maximum Subarray

출처: https://www.acmicpc.net/problem/10211

 Input 

2

5

1 2 3 4 5

5

2 1 -2 3 -5

　 

 Output 

15

4

연속된 부분 합 (연속합) 내용 참고

---

import java.util.Scanner;
 
public class Main {    
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        
        int T = Integer.parseInt(sc.next());
        while(T-- > 0) {
            int N = Integer.parseInt(sc.next());;
            int[] arr = new int[N];
            for(int i=0; i<N; i++) {
                arr[i] = Integer.parseInt(sc.next());
            }
            System.out.println(findMaximumSubArray(arr));
        }
    }
 
    private static int findMaximumSubArray(int[] A) {
        int answer = Integer.MIN_VALUE;
        int partialSum = Integer.MIN_VALUE;
        
        for(int i=0; i<A.length; i++) {
            partialSum = Math.max(partialSum, 0) + A[i];
            answer = Math.max(answer, partialSum);
        }
        
        return answer;
    }
}