SubSequence With Maximum Odd Sum

package hackerRank.problem.practice;

import java.io.BufferedReader;                                  // Time Complexity:O(n)
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;

public class Stats1{
	 public static void main(String[] args) throws IOException {
	        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
	        PrintWriter wr = new PrintWriter(System.out);
	        int T = Integer.parseInt(br.readLine().trim());
	        for(int t_i=0; t_i<T; t_i++)
	        {
	            int N = Integer.parseInt(br.readLine().trim());
	            String[] arr = br.readLine().split(" ");
	            int[] array_int = new int[N];
	            for(int i=0; i<arr.length; i++)
	            {
	            	array_int[i] = Integer.parseInt(arr[i]);
	            }

	            int out_ = findMaxOddSubarraySum(array_int,N);
	            System.out.println(out_);
	         }

	         wr.close();
	         br.close();
	    }
	    static int findMaxOddSubarraySum(int arr[], int n)
	    {
	    	// Here min_odd is the minimum odd number (in
	    	// absolute terms). Initializing with max value
	    	// of int .
	    	int m = Integer.MAX_VALUE;

	    	// To check if there is al-least one odd number.
	    	boolean isOdd = false;

	    	int sum = 0; // To store sum of all positive elements
	    	for (int i=0 ; i<n ; i++)
	    	{
	    		// Adding positive number would increase
	    		// the sum.
	    		if (arr[i] > 0)
	    			sum = sum + arr[i];

	    		// To find the minimum odd number(absolute)
	    		// in the array.
	    		if (arr[i]%2 != 0)
	    		{
	    			isOdd = true;
	    			if (m > Math.abs(arr[i]))
	    				m = Math.abs(arr[i]);
	    		}
	    	}

	    	// If there was no odd number
	    	if (isOdd == false)
	    	return -1;

	    	// Now, sum will be either odd or even.
	    	// If even, changing it to odd. As, even - odd = odd.
	    	// since m is the minimum odd number(absolute).
	    	if (sum%2 == 0)
	    		sum = sum - m;

	    	return sum;
	    }
	}