[백준] 1912번 연속합 문제! (silver 2

import java.io.*;
import java.util.*;

public class Main{
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
        int n=Integer.parseInt(br.readLine());
        StringTokenizer st=new StringTokenizer(br.readLine());
        int[] num=new int[n];
        for(int i=0; i<n; i++){
            num[i]=Integer.parseInt(st.nextToken());
        }
        int max=num[0];
        for(int i=1; i<n; i++){
            int temp=num[i-1];
            if(temp>=0) {
                num[i] = temp + num[i];
                if (num[i] < temp) {
                    max = max > temp ? max : temp;
                }
                else{
                    max= max > num[i] ? max : num[i];
                }
            }
            else if(temp<0){
                max= max > num[i] ? max : num[i];
            }
        }
        bw.write(max+"");
        bw.flush();
    }
}