Maximum_Subarray.java

import java.util.Scanner;

public class Playground2 {

	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		
		int n = scanner.nextInt();
		int[] nums = new int[n];
		
		int max = 0;
		int sumSoFar = 0;
		int startIndex = 0;
		int endIndex = 0;
		
		for (int i = 0; i < n; i++) {
			nums[i] = scanner.nextInt();
			
			if (sumSoFar == 0 && sumSoFar + nums[i] > 0) {
				startIndex = i;
			}
			
			sumSoFar += nums[i];
			if (sumSoFar < 0) {
				sumSoFar = 0;
			}
			if (max < sumSoFar) {
				max = sumSoFar;
				endIndex = i;
			}
		}
		System.out.println(max);
		for (int i = startIndex; i <= endIndex; i++) {
			System.out.printf("%d ", nums[i]);
		}
	}
}