Sum_of_contiguous_array.java

public static void main(String[] args) 
    { 
        FastReader s=new FastReader(); 
        int n = s.nextInt(); //accepting size of an array
        int k = s.nextInt(); //no. of terms to add
        int a[] = new int[n];
        for(int i=0; i<n; i++)a[i] = s.nextInt(); // inputting array
        
        int maximum_sum = Integer.MIN_VALUE;
        for(int i=0; i< n-k+1; i++){
          
            int curr_sum = 0;
            for(int j=0; j<k; j++){
              
                curr_sum = curr_sum + a[i + j];
                //updating the maximum_sum
                maximum_sum = Math.max(curr_sum, maximum_sum);
            }//end of j for loop
          
        } // end of i for loop
        System.out.println(maximum_sum);     
    }