Problem 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?thbird 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≤n,m≤1000000(106)1≤h[i],q[i]≤1000000000(109)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. ?

?

Source BestCoder Round #36 ($)

?

用map保存數(shù)量即可。

1 #pragma comment(linker, "/STACK:1024000000,1024000000") 2 #include<iostream> 3 #include<cstdio> 4 #include<cstring> 5 #include<cmath> 6 #include<math.h> 7 #include<algorithm> 8 #include<queue> 9 #include<set> 10 #include<bitset> 11 #include<map> 12 #include<vector> 13 #include<stdlib.h> 14 #include <stack> 15 using namespace std; 16 #define PI acos(-1.0) 17 #define max(a,b) (a) > (b) ? (a) : (b) 18 #define min(a,b) (a) < (b) ? (a) : (b) 19 #define ll long long 20 #define eps 1e-10 21 #define MOD 1000000007 22 #define N 1000000 23 #define inf 1e12 24 int n,m; 25 map<int,int>mp; 26 int main() 27 { 28 while(scanf("%d%d",&n,&m)==2){ 29 mp.clear(); 30 for(int i=0;i<n;i++){ 31 int x; 32 scanf("%d",&x); 33 mp[x]++; 34 } 35 for(int i=0;i<m;i++){ 36 int x; 37 scanf("%d",&x); 38 printf("%d\n",mp[x]); 39 mp[x]=0; 40 } 41 } 42 return 0; 43 } View Code

?

總結(jié)

以上是生活随笔為你收集整理的hdu 5199 Gunner（STL之map，水）的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。