丰收

传送门：https://www.nowcoder.com/questionTerminal/83b419c027fa490aa60669b0e7dc06a3

#include <cstdio>
#include <iostream>
using namespace std;
const int MAXN = 1e5 + 5;
 
int n, m, q;
int s[MAXN];
 
int main() {
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) {
        scanf("%d", &s[i]);
        s[i] += s[i - 1];
    }
    scanf("%d", &m);
    for (int i = 1; i <= m; i++) {
        scanf("%d", &q);
        //binary search
        int low = 1, high = n;
        while (low < high) { //
            int mid = (low + high) >> 1;
            if (s[mid] < q) low = mid + 1;
            else high = mid;
        }
        printf("%d\n", high);
    }
    return 0;
}