题目:
Comparison of Android versions
Time Limit:4000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u
Submit Status Practice HDU 5199
Description
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$.
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.
Output
For each $q[i]$, output an integer in a single line indicates the number of birds Jack shot down.
Sample Input
4 3
1 2 3 4
1 1 4
Sample Output
1
0
1
Hint
Huge input, fast IO is recommended.
题目大意:
给n个数,表示在ai高度有一只鸟,再给m个数,表示朝向bi的位置射击,输出每次射击能打掉多少只鸟
题目思路:
1、题目高度范围很大,不能用数组,而用二分,所以我们选用map
2、Map[i]=j 表示i的位置有j只鸟
程序:
#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<cctype>
#include <fstream>
#include <limits>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cassert>
using namespace std;
int main()
{
int n,m;
while(~scanf("%d %d",&n,&m))
{
map<int,int>ma;
ma.clear();
for(int i=1;i<=n;i++)
{
int t;
scanf("%d",&t);
ma[t]++;//t位置增加一只鸟
}
for(int i=1;i<=m;i++)
{
int t;
scanf("%d",&t);
printf("%d\n",ma[t]);
ma[t]=0;//清空
}
}
return 0;
}