暑假集训第三周周三赛 STL E - Gunner 射鸟
来源:互联网 发布:五金店做账用什么软件 编辑:程序博客网 时间:2024/05/29 10:57
E - Gunner
Time Limit:4000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uDescription
Long long ago, there is a gunner whose name is Jack. He likes to go hunting very much. One day he go to the grove. There are $n$ birds and $n$ trees. The $i-th$ bird stands on the top of the $i-th$ tree. The trees stand in straight line from left to the right. Every tree has its height. Jack stands on the left side of the left most tree. When Jack shots a bullet in height H to the right, the bird which stands in the tree with height $H$ will falls.
Jack will shot many times, he wants to know how many birds fall during each shot.
a bullet can hit many birds, as long as they stand on the top of the tree with height of $H$.
Jack will shot many times, he wants to know how many birds fall during each shot.
a bullet can hit many birds, as long as they stand on the top of the tree with height of $H$.
Input
There are multiple test cases (about 5), every case gives $n,m$ in the first line, $n$ indicates there are $n$ trees and $n$ birds, $m$ means Jack will shot $m$ times.
In the second line, there are $n$ numbers $h[1],h[2],h[3],…,h[n]$ which describes the height of the trees.
In the third line, there are m numbers $q[1],q[2],q[3],…,q[m]$ which describes the height of the Jack’s shots.
Please process to the end of file.
[Technical Specification]
$1 \leq n,m \leq 1000000(10^{6})$
$1 \leq h[i],q[i] \leq 1000000000(10^{9})$
All inputs are integers.
In the second line, there are $n$ numbers $h[1],h[2],h[3],…,h[n]$ which describes the height of the trees.
In the third line, there are m numbers $q[1],q[2],q[3],…,q[m]$ which describes the height of the Jack’s shots.
Please process to the end of file.
[Technical Specification]
$1 \leq n,m \leq 1000000(10^{6})$
$1 \leq h[i],q[i] \leq 1000000000(10^{9})$
All inputs are integers.
Output
For each $q[i]$, output an integer in a single line indicates the number of birds Jack shot down.
Sample Input
4 31 2 3 41 1 4
Sample Output
101
分析:
本题用到一个find()函数,它也是遍历,但它只能遍历找到一个数据,而迭代器是找到所有数据
比如 3 3 find只能输出一个,而迭代器可以输出两个
0 0
- 暑假集训第三周周三赛 STL E - Gunner 射鸟
- 暑假集训第三周周三赛 STL D - 产生冠军
- 暑假集训第三周周三赛 STL F - 水果
- 暑假集训第三周周三赛 STL G - Intelligent IME
- 暑假集训第三周周三赛 STL A - So easy 判断集合
- 暑假集训第三周周三赛 STL C - Strange Class 字符相同 SC数
- AYIT2017暑假集训第二周周三赛 E
- AYIT2017暑假集训第三周周三赛 A
- dfs+剪枝(暑假集训第三周周测E)
- 暑假集训第三周周六赛 搜索 E - N皇后问题
- 暑假集训第三周周六赛 STL D - 胜利大逃亡
- 暑假集训第四周周三赛 E - Charm Bracelet 最大魅力
- 暑假集训第四周周三赛F - Knight Moves 骑士的移动 STL
- AYIT2017暑假集训第二周周三赛 A
- AYIT2017暑假集训第二周周三赛 B
- AYIT2017暑假集训第二周周三赛 C
- AYIT2017暑假集训第二周周三赛 G
- AYIT2017暑假集训第二周周三赛 D
- 我的C语言入门到精通之路 day03
- Word Search
- cenyos7安装telnet服务器
- HD2141 Can you find it? 【二分法求解】
- JavaScript学习
- 暑假集训第三周周三赛 STL E - Gunner 射鸟
- 在云计算时代,如何监控云服务的 SLA ?
- Android 当Service遇到Handler
- Observer模式
- poj 1258 Agri-Net
- [leetcode-43]Multiply Strings(java)
- Bridging signals
- H264 各种profile
- Ubuntu 12.04 安装中文输入法