Yyds dry goods inventory ＃ solve the real problem of famous enterprises: continuous maximum sum

1. sketch ：

describe

An array has N Elements , Find the maximum sum of successive subarrays . for example ：[-1,2,1], And the largest continuous subarray is [2,1], The sum is 3

Input description ：

Enter in two lines . The first line is an integer n(1 <= n <= 100000), Means that there are n Elements Second behavior n Number , That is, every element , Every integer is in 32 position int Within the scope of . Space off .

Output description ：

The largest value in all successive subarrays .

Example 1

Input ：

Log in and copy

      
      

       
       3
       
       
-1 2 1
      
      
      
      

       
       
1.
       
       
2.
      
      

Output ：

Log in and copy

      
      

       
       3
      
      
      
      

       
       
1.
      
      

2. Code implementation ：

Log in and copy

      
      

       
       import java.util.Scanner;
       
       
public class Main{
       
       
    public static void main(String[] args){
       
       
        Scanner sc = new Scanner(System.in);
       
       
        int n = sc.nextInt();
       
       
        int sums=0, maxsums=Integer.MIN_VALUE; // Consider the case of all negative numbers 
       
       
        for(int i=0;i<n;i++){
       
       
            sums+=sc.nextInt();
       
       
            maxsums=Math.max(maxsums,sums);
       
       
            sums= sums<0?0:sums; // Code core , If the current sum is negative , Then discard the previous continuous array , Start summing again 
       
       

       
       
        }
       
       
        System.out.println(maxsums);
       
       
    }
       
       
}
       
       

      
      
      
      

       
       
1.
       
       
2.
       
       
3.
       
       
4.
       
       
5.
       
       
6.
       
       
7.
       
       
8.
       
       
9.
       
       
10.
       
       
11.
       
       
12.
       
       
13.
       
       
14.
       
       
15.