枪打鸟的问题
来源:互联网 发布:java形参实参 编辑:程序博客网 时间:2024/06/08 15:46
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
Hint
Huge input, fast IO is recommended.
分别表示的是,第一行那只鸟分别在不同的n只树上,然后猎人站在不同的高度去打鸟,与鸟相同的高度就可以打到鸟,,
如果两次均在同一个高度打鸟则只有第一次可以打到鸟。
以下是代码:
0 0
- 枪打鸟的问题
- 问题背后的问题
- 关于问题的问题
- 问题背后的问题
- 有问题的问题?.?
- 的问题
- 问题++: firefox的关闭问题
- 问题:input类型的问题
- 百鸡问题的问题
- 5.4 关于问题的问题
- 优化问题的对偶问题
- [问题]AS的问题集锦
- “存钱问题”遇到的问题
- 求伯君的问题还是记者的问题?
- StoreAccess的问题【datasource的问题】
- 奇怪的问题(关于数据库的问题)
- kinect的坐标单位问题的问题
- 不大的问题--offsetLeft的问题
- try{}里有一个return语句,那么紧跟在这个try后的finally{}里的code会不会被执行,什么时候被执行?在return前还是后?
- nyoj58 最少步数(DFS)
- php常量 DIRECTORY_SEPARATOR 和 PATH_SEPARATOR
- MYSQL主从安装与配置
- iOS UI02_Button和Textfield
- 枪打鸟的问题
- java简单选择排序
- 最小生成树之kruskal算法
- pandas time series/data functionality
- iBatis开发详解(7)-------------执行非查询语句(CRUD,函数和过程
- HBase meta表数据修复
- #openstack-meeting: swift(2015-07-29)
- UIView
- android 屏幕旋转 activity中多个fragment重叠