Maximum sum

import java.util.Scanner;

public class MaxSum {

    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        int n = input.nextInt();

        int[] numbers = new int[n+1];
        for (int i = 1; i <= n; i++){
            numbers[i] = input.nextInt();
        }
        int[] maxSumToI = new int[n + 1];
        int max = numbers[1];
        for (int i = 1; i <= n; i++){
            if(maxSumToI[i-1] > 0) {
                maxSumToI[i] = numbers[i] + maxSumToI[i-1];
            } else {
                maxSumToI[i] = numbers[i];
            }
            if (maxSumToI[i] > max) {
                max = maxSumToI[i];
            }
        }


        System.out.print(max);
    }
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: TIME LIMIT EXCEEDED

Test 9

Verdict: TIME LIMIT EXCEEDED

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED