CodeForces 474B（标记用法）

CodeForces 474B

Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u

Description

It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.

Marmot brought Mole n ordered piles of worms such that i-th pile contains a_i worms. He labeled all these worms with consecutive integers: worms in first pile are labeled with numbers 1 to a₁, worms in second pile are labeled with numbers a₁ + 1 to a₁ + a₂ and so on. See the example for a better understanding.

Mole can't eat all the worms (Marmot brought a lot) and, as we all know, Mole is blind, so Marmot tells him the labels of the best juicy worms. Marmot will only give Mole a worm if Mole says correctly in which pile this worm is contained.

Poor Mole asks for your help. For all juicy worms said by Marmot, tell Mole the correct answers.

Input

The first line contains a single integer n (1 ≤ n ≤ 10⁵), the number of piles.

The second line contains n integers a₁, a₂, ..., a_n (1 ≤ a_i ≤ 10³, a₁ + a₂ + ... + a_n ≤ 10⁶), where a_i is the number of worms in the i-th pile.

The third line contains single integer m (1 ≤ m ≤ 10⁵), the number of juicy worms said by Marmot.

The fourth line contains m integers q₁, q₂, ..., q_m (1 ≤ q_i ≤ a₁ + a₂ + ... + a_n), the labels of the juicy worms.

Output

Print m lines to the standard output. The i-th line should contain an integer, representing the number of the pile where the worm labeled with the number q_i is.

Sample Input

Input

5
2 7 3 4 9
3
1 25 11

Output

1
5
3

Hint

For the sample input:

The worms with labels from [1, 2] are in the first pile.
The worms with labels from [3, 9] are in the second pile.
The worms with labels from [10, 12] are in the third pile.
The worms with labels from [13, 16] are in the fourth pile.
The worms with labels from [17, 25] are in the fifth pile.
题解：这道题如果只是读题很难完全懂，可以结合输入案例，就是第一行数据为5是行数，第二行数据为2，7，3，4，9，意思为排列的第一行有2个数，第二行有7个，以此类推，到第5行，第三行数据是输入要判断的数字的个数，第四行数据是输入要判断的数字，判断其所在行数。
如下所示：
1 2
3 4 5 6 7 8 9
10 11 12
13 14 15 16 17
18 19 20 21 22 23 24 25
要判断案例中1，25 11所在的行数，首先可以建立一个数组，依次排列，把每一行都标记，第一行标记为1，以此类推，当输入一个数q时，输出a【q】，就可以得到所在的行数。
标记时要注意其范围，标记完一行要进行+1，才可到达第二行。

#include<iostream>
using namespace std;
int a[100];
int main()
{
    int q,s,n,i,t,tot,f=1;
    while(cin>>n)
    {
        tot=1;
        for(int j=1; j<=n; j++)
        {
            cin>>t;
            for(i=tot; i<t+tot; i++)
                a[i]=f;
            f++;//每标记一次，f++，到达下一行
            tot=i;
        }

        cin>>q;

        for(i=1; i<=q; i++)
        {
            cin>>s;
            cout<<a[s]<<endl;//输入数字q，输出a【q】，得到的就是q所在的行

        }
    }

    return 0;
}