codeforces—— 474B —— Worms
来源:互联网 发布:可视化编程中文 编辑:程序博客网 时间:2024/05/18 00:50
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 that i-th pile contains ai worms. He labeled all these worms with consecutive integers: worms in first pile are labeled with numbers 1 to a1, worms in second pile are labeled with numbers a1 + 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.
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), where ai is the number of worms in the i-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.
Print m lines to the standard output. The i-th line should contain an integer, representing the number of the pile where the worm labeled with the number qi is.
52 7 3 4 931 25 11
153
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.
#include<iostream>#include<stdio.h>#include<stdlib.h>#include<math.h>using namespace std;int com[1000008];int main(){ int n; while(cin>>n) { int a[100008]; for(int i=0; i<n; i++) cin>>a[i]; for(int i=1; i<n; i++) a[i]+=a[i-1]; int flag=0; for(int i=0; i<=a[n-1]; i++) com[i]+=(i<=a[flag]?flag:++flag)+1; int m; cin>>m; while(m--) { int temp; cin>>temp; cout<<com[temp]<<endl; } } return 0;}
- codeforces—— 474B —— Worms
- [Codeforces] 474B - Worms
- CodeForces 474B(Worms)
- CodeForces 474B Worms 二分
- Codeforces 474B Worms (二分查找)
- Codeforces 474B Worms 二分(水
- 【CODEFORCES】 B. Worms
- CF 474B Worms
- B. Worms Codeforces Round #271 (div2)
- Codeforces Round #271 (Div. 2)--B.Worms
- B. Worms
- B. Worms
- Codeforces Round #271 (Div. 2) --B Worms (二分)
- codeforces——B. Spreadsheets
- Codeforces —— 359B Permutation
- CodeForces 154B——Colliders
- codeforces——B. Months and Years
- CodeForces 535B — Tavas and SaDDas
- Robberies HDU
- android 获取ip 设备唯一号 版本号 的方法
- 【数论】Lucas定理推导过程+模板
- spring集成coherence报错Unsupported major.minor version 52.0
- Windows安装配置libtorrent
- codeforces—— 474B —— Worms
- Python 列表的生成
- oracle 复习
- Storyboard中的UIScrollView使用自动布局,使其能够滚动
- ndgrid 和 meshgrid 函数-Matlab
- .Net使用Redis详解之ServiceStack.Redis
- library "/lib/libgnustl_shared.so not found
- node-red 自定义节点的创建
- iOS CoreAnimation动画详解(一)