Worms
来源:互联网 发布:c语言求绝对值的函数 编辑:程序博客网 时间:2024/05/11 22:08
Description
It is lunch time for Mole. His friend, Marmot, prepared him a nice game for lunch.
Marmot brought Mole n ordered piles of worms such thati-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are labeled with numbers1 to a1, worms in second pile are labeled with numbersa1 + 1 to a1 + a2 and so on. See the example for a better understanding.
Mole can't eat all the worms (Marmot brought a lot) and, as we all know, Mole is blind, so Marmot tells him the labels of the best juicy worms. Marmot will only give Mole a worm if Mole says correctly in which pile this worm is contained.
Poor Mole asks for your help. For all juicy worms said by Marmot, tell Mole the correct answers.
Input
The first line contains a single integer n (1 ≤ n ≤ 105), the number of piles.
The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 103,a1 + a2 + ... + an ≤ 106), whereai is the number of worms in thei-th pile.
The third line contains single integer m (1 ≤ m ≤ 105), the number of juicy worms said by Marmot.
The fourth line contains m integers q1, q2, ..., qm (1 ≤ qi ≤ a1 + a2 + ... + an), the labels of the juicy worms.
Output
Print m lines to the standard output. Thei-th line should contain an integer, representing the number of the pile where the worm labeled with the numberqi is.
Sample Input
52 7 3 4 931 25 11
153
Hint
For the sample input:
- The worms with labels from [1, 2] are in the first pile.
- The worms with labels from [3, 9] are in the second pile.
- The worms with labels from [10, 12] are in the third pile.
- The worms with labels from [13, 16] are in the fourth pile.
- The worms with labels from [17, 25] are in the fifth pile.
说好的 105,总RE,开到106才AC,醉了
#include<cstdio>#include<iostream>#include<algorithm>using namespace std;int num[1000010];int main(){ int n,i,t,m,k,j,number,pile; while(cin>>n){ number=1; pile=1; for(i=0;i<n;i++){ cin>>t; for(j=number;j<t+number;j++){ num[j]=pile; } number=j;//number=t+number; pile++; } cin>>m; for(i=0;i<m;i++){ cin>>k; cout<<num[k]<<endl; } } return 0;}
- Worms
- HDU4404 Worms
- B. Worms
- B. Worms
- Google Search API Worms
- <cf>Worms Evolution
- hdu 4404 Worms
- Worms(水题)
- [Codeforces] 474B - Worms
- CodeForces 474B(Worms)
- 【CODEFORCES】 B. Worms
- CF 474B Worms
- A. Worms Evolution
- hdu 4404 worms #by nobody
- CodeForces 474B Worms 二分
- Why is OpenVMS Secure? Worms? Viruses?
- Ubuntu下wine玩Worms World Party
- Timeline of computer viruses and worms
- 使用Android ViewPager与PhotoView实现图片滑动查看
- RaspberryPi: Proxy Server (Goagent-->XX-Net)
- 单一职责原则
- C语言--数组与指针的学习
- ios与android开发对比之Button-01
- Worms
- Develop--Training(六)Getting Started--Working with System Permissions
- UUID 获取设备的唯一标志
- linux下wait命令的使用小结
- Bootstrap字体图标(glyphicons)
- Tomcat安装程序包的版本
- web前端之路(1)--清除浮动的三种方式
- 奇巧淫技之Excel汉字转拼音
- TP:C319327B