Envío 6273

Código

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();

        int[] array = new int[n];
        for(int i=0; i<n; i++){
            array[i] = scanner.nextInt();
        }

        int c = scanner.nextInt();
        for(int i=0; i<c; i++){
            System.out.println(succesorBinarySearch(0, n-1, array, scanner.nextInt()));
        }
    }


    private static int succesorBinarySearch(int start, int end, int[] array, int search){
        if(start == end || end-start == 1){
            if(search<array[start]){
                return start;
            }

            if(search<array[end]){
                return end;
            }

            return array.length;
        }

        int middle = (start+end)/2;

        if(array[middle-1]<=search && array[middle]>search){
            return middle;
        } else if (search >= array[middle]){
            return succesorBinarySearch(middle+1, end, array, search);
        } else {
            return succesorBinarySearch(start, middle-1, array, search);
        }
    }
}