Data Structures and Algorithms - Linear Structures Review Questions 7-5 Maximum Subcolumn Sum Problem (10 points)

The question is the same as the Likou 53 question, and it is solved by dynamic programming.

 
import java.util.*;
public class Main{
    
    
    public  static  int maxSubArray(int[] nums) {
    
    
        int res = nums[0];
        for(int i = 1; i < nums.length; i++) {
    
    
            nums[i] += Math.max(nums[i - 1], 0);
            res = Math.max(res, nums[i]);
        }
        return res;
    }
    public static void main (String[] args) {
    
    
        Scanner scanner=new Scanner (System.in);
        int a[]=new int[1000010];
        int k=scanner.nextInt ();
        for (int i = 0 ; i <k  ; i++) {
    
    
            a[i]=scanner.nextInt ();
        }
        System.out.println (maxSubArray (a));
    }
}