Шеф-повар и сумма с префиксом и суффиксом(получение некоторого тестового случая не удалось)

Our little chef is fond of doing additions/sums in his free time. Today, he has an array A consisting of N positive integers and he will compute prefix and suffix sums over this array.

He first defines two functions prefixSum(i) and suffixSum(i) for the array as follows. The function prefixSum(i) denotes the sum of first i numbers of the array. Similarly, he defines suffixSum(i) as the sum of last N - i + 1 numbers of the array.

Little Chef is interested in finding the minimum index i for which the value prefixSum(i) + suffixSum(i) is the minimum. In other words, first you should minimize the value of prefixSum(i) + suffixSum(i), and then find the least index i for which this value is attained.

<pre>import java.util.*;
import java.lang.*;
import java.io.*;
 
/* Name of the class has to be "Main" only if the class is public. */
class Codechef
{
	public static void main (String[] args) throws java.lang.Exception
	{
	int t;
	Scanner sc=new Scanner(System.in);
	t=sc.nextInt();
	for(int i=0;i<t;i++)
	{
	    int n=sc.nextInt();
	    int sum=0,count=0,min=Integer.MAX_VALUE;
	    int[] arr=new int[n+1];
	    int[] prefix=new int[n+1];
	    int[] suffix=new int[n+1];
	    int[] array=new int[n];
        int[] array1=new int[n];
	    for(int j=0;j<n;j++)
	    {
	    arr[j]=sc.nextInt();
	    sum+=arr[j];
	    }
	    suffix[0]=sum;
	   for(int j=1;j<n;j++)
	   {
	       sum-=(arr[j-1]);
	       suffix[j]=sum;
	   }
	     prefix[0] = arr[0];
	     for (int j = 1; j < n; j++)
	     {
	         prefix[j] = prefix[j-1] + arr[j];
	        
	     }
	     int max=Integer.MAX_VALUE;
	     for(int j=0;j<n;j++)
	     {
	         array[j]=suffix[j]+prefix[j];
             if(min>=array[j])
                 min=array[j];
           //  array1[j]=array[j];
	        //System.out.print(array[j] +" ");
	    // min=Math.min(min,array[j]);
	     }
      
	   
//	     max=array[0];
	   for(int j=0;j<array.length;j++)
	   {
	       if(array[j]==min)
           {
               if(max>=j)
                   max=j;
           }
	     //  System.out.println(j);
	    // System.out.print(array[j]+" ");
	      
	   }
       System.out.println(max+1);
        
	}
	}
}