bzoj3412

题解：

先把询问排序

然后根据单调性来做

代码：

#include<bits/stdc++.h>
using namespace std;
int n,m,a[],b[],f[],ans[];
int cmp(int x,int y)
{
    return b[x]<b[y];
}
int main()
{
    scanf("%d%d",&n,&m);
    int num=,j=;
    for (int i=;i<=n;i++)scanf("%d",&a[i]);
    for (int i=;i<=m;i++)scanf("%d",&b[i]),f[i]=i;
    sort(f+,f+m+,cmp);
    for (int i=;i<=m;i++)
     {
        while (a[j]+num<=b[f[i]])num+=a[j],j++;
        ans[f[i]]=j;
     }
    for (int i=;i<=m;i++)printf("%d\n",ans[i]);
}