【链家笔试题】部队分组

import java.util.Scanner;

public class Main {

private static int find(int[] array, int num) {
int low = 0;
int high = array.length - 1;
while (low <= high) {
int mid = (low + high) / 2;
if (num >= array[mid] && num < array[mid + 1]) {
return mid;
}
if (num > array[mid]) {
low = mid + 1;
} else if (num < array[mid]) {
high = mid - 1;
}
}
return -1;
}

public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] num = new int[n + 1];
num[0] = 1;
for (int i = 1; i <= n; i++) {
int temp = sc.nextInt();
num[i] = num[i - 1] + temp;
}
int k = sc.nextInt();
int[] q = new int[k];
for (int i = 0; i < k; i++) {
q[i] = sc.nextInt();
}
for (int i = 0; i < q.length; i++) {

System.out.println(find(num, q[i])+1);
}

}
}