题解

终于遇到本蒟蒻可以秒ac的题了awa

#include<bits/stdc++.h>
using namespace std;
using ll=long long;
const int N=1e5+5;

ll n,a[N],k,sum[N];

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    cin>>n;
    for(ll i=1;i<=n;i++){
        cin>>a[i];
        sum[i]=sum[i-1]+a[i];
    }
    cin>>k;

    while(k--){
        ll q;

        cin>>q;

        int l=1,r=n,mid;
        while(l<=r){
            mid=(l+r)/2;

            if(sum[mid]<=q) l=mid+1;
            else r=mid-1;
        }

        cout<<--l<<'\n';
    }
    
    return 0;
}