View Code of Problem 19

import java.util.Arrays;
import java.util.HashMap;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        while (scanner.hasNext()) {
            Integer get = Integer.valueOf(scanner.nextLine());
            if (get != 0) {
                int[] array = Arrays.stream(scanner.nextLine().split(" "))
                        .mapToInt((String g) -> {
                            return Integer.valueOf(g);
                        }).toArray();
                int biggest = array[0];
                for (int i = 0; i < array.length; i++) {
                    if (array[i] > 0) {
                        int sum = array[i];
                        for (int j = i + 1; j < array.length; j++) {
                            if (biggest < sum + array[j]) {
                                biggest = sum + array[j];
                            }
                            sum += array[j];
                        }
                    }
                }
                System.out.println(biggest);
            } else {
                break;
            }

        }
    }
}