题解 | 音符

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


ll b[N];
ll pres[N];

void solve(){
    int n,q;
    cin>>n>>q;
    for(int i=1;i<=n;i++)
    {
        cin>>b[i];
        pres[i] = pres[i-1]+b[i];
    }

    while(q--)
    {
        ll t;
        cin>>t;
        int ans = upper_bound(pres+1,pres+1+n,t)-pres;
        cout<<ans<<'\n';

    }


    
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t=1;
    // cin>>t;
    while(t--) 
    {
        solve();
    }
    return 0;
}

二分模板题