题解 | #丰收-二分查找#

#include<vector>

using namespace std;
int main(void)
{
    int n;
    cin>>n;
    
    vector<int> a(n+1,0);
    
    a[0] = 0;
    
    for(int i=1;i<=n;i++)
    {
        int tmp;
        cin>>tmp;
        a[i]+=a[i-1]+tmp;
    }
    
    int m;
    cin>>m;
    
     vector<int> q(m,0);
    
    for(int i=0;i<m;i++)
        cin>>q[i];
        
    for(int j=0;j<m;j++)
    {
        int left = 1;
        int right = n;
        
        
        while(left<=right)
        {
            int mid = left + (right-left)/2;

           // cout<<"q[j]:"<<q[j]<<" mid:"<<mid<<endl;
            
            if(q[j]<=a[mid]&&(mid==1||mid==n||q[j]>a[mid-1]))
            {
                
                cout<<mid<<endl;
                break;
            }
            else if(q[j]<a[mid])
            {
                right = mid - 1;
            }
            else if(q[j]>a[mid])
            {
                left = mid + 1;
            }

        }
        
        /*
        for(int i=1;i<=n;i++)
        {
            if(q[j]<=a[i])
            {
                cout<<i<<endl;
                break;
            }
            
        }
        */
    }
        
        return 0;
}