北邮机试 查找 Easy

基本思想:

hash查找;

 

关键点：

无；

 

#include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;

const int maxn = 150;

int thash[maxn];

int main() {
    int n,m;
    while (cin>>n){
        fill(thash, thash + maxn, -1);
        int a;
        for (int i = 0; i < n; i++) {
            cin >> a;
            thash[a] = i;
        }
        cin >> m;
        for (int i = 0; i < m; i++) {
            cin >> a;
            if (thash[a] == -1) {
                cout << "NO" << endl;
            }
            else {
                cout << "YES" << endl;
            }
        }
    }
    return 0;
}