CodeForces 474B Worms 二分

#include<stdio.h>
#include<iostream>
#include<math.h>
#include<string.h>
#include<iomanip>
#include<stdlib.h>
#include<ctype.h>
#include<algorithm>
#include<deque>
#include<functional>
#include<iterator>
#include<vector>
#include<list>
#include<map>
#include<queue>
#include<set>
#include<stack>
#define CPY(A, B) memcpy(A, B, sizeof(A))
typedef long long LL;
typedef unsigned long long uLL;
const int MOD = int (1e9) + 7;
const int INF = 0x3f3f3f3f;
const LL INFF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-9;
const double OO = 1e20;
const double PI = acos (-1.0);
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
using namespace std;
int a[100100];
int q[100100];
int f (int que,int q[],int n) {
    int l=0,r=n,m;
    while (l<=r) {
        m= (l+r) /2;
        if (q[m]<que) { l=m+1;}
        else if (q[m]>que) { r=m-1;}
        else { return m;}
    }
    return l;
}//二分
int main() {
    int n,m,que,i,cnt=0;
    while (~scanf ("%d",&n)) {
        q[cnt++]=0;
        for (i=0; i<n; i++) {
            scanf ("%d",&a[i]);
            q[cnt]=q[cnt-1]+a[i];
            cnt++;
        }
        scanf ("%d",&m);
        for (i=0; i<m; i++) {
            scanf ("%d",&que);
            printf ("%d\n",f (que,q,n) );
        }
    }
    return 0;
}