hdu 5233 Gunner II (bc #42 B) (离散化)

Gunner II

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 1433    Accepted Submission(s): 540

Problem Description

Long long ago, there was 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 nearest bird which stands in the tree with height H will falls.

Jack will shot many times, he wants to know which bird will fall during each shot.

 

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]

All input items are integers.

1<=n,m<=100000(10^5)

1<=h[i],q[i]<=1000000000(10^9)

 

Output

For each q[i], output an integer in a single line indicates the id of bird Jack shots down. If Jack can’t shot any bird, just output -1.

The id starts from 1.

 

Sample Input
5 5
1 2 3 4 1
1 3 1 4 2

 

Sample Output
1
3
5
4
2

Hint

Huge input, fast IO is recommended.

 

Source
因为一共才1E5的数据,而高度有1E9
所以考虑离散化
关于离散化的内容,这篇博客讲得很好。
http://blog.csdn.net/axuan_k/article/details/45954561
我是使用了第三种map+set的方法。。。
离散化大概是因为数据太大下表存不下。。。
然后map的key 值没有范围?所以实现了离散化(是这样嘛???)

还有一种写法,貌似要快一点,但是空间用的多一些:

作者: CrazyKK

ex-ACMer@hust,stackoverflow-engineer@sensetime

说点什么

您将是第一位评论人!

提醒
wpDiscuz