题目链接:https://www.luogu.com.cn/problem/P1918
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <unordered_map>
using namespace std;
int n;
unordered_map<int, int> h;
int main(){
cin >> n;
for (int i = 1; i <= n; i ++){
int a; cin >> a;
h[a] = i;
}
int q; cin >> q;
while (q -- ){
int a; cin >> a;
if (h.count(a)) cout << h[a] << endl;//, h.erase(a);
else puts("0");
}
return 0;
}