01-复杂度1 最大子列和问题 (20分)

import java.util.Scanner;

public class Main {
    static int N;
    static int[] num = new int[100000];
    static int MaxSum = 0;

    public static void MaxSum(int[] num , int N){
        int ThisSum = 0;
        for ( int i = 0; i < N ; i++){
            ThisSum += num[i];
            if ( MaxSum < ThisSum){
                MaxSum = ThisSum;
            }else if (ThisSum < 0){
                ThisSum = 0;
            }
        }
    }

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        Scanner in = new Scanner(System.in);
        N = in.nextInt();
        for ( int i = 0 ; i < N ; i++){
            num[i] = in.nextInt();
        }
        MaxSum(num, N);
        System.out.print(MaxSum);
        in.close();
    }

}