#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
int main()
{
int n;
cin>>n;
vector<int> a;
int start=1;
a.push_back(start);
for(int i=0;i<n;i++)
{
int temp;
cin>>temp;
start+=temp;
a.push_back(start);
}
int m;
cin>>m;
for(i=0;i<m;i++)
{
int q;
cin>>q;
int start=0,end=n-1;
while(start<=end)
{
int mid=(start+end)/2;
if(a[mid]<=q&&q<a[mid+1])
{
cout<<mid+1<<endl;
break;
}
else if(q<a[mid])
{
end=mid-1;
}
else if(q>=a[mid+1])
{
start=mid+1;
}
}
}
return 0;
}
网易笔试题:第x个苹果属于哪一堆
猜你喜欢
转载自blog.csdn.net/u012991043/article/details/81588889
今日推荐
周排行