HDU_5199

#include<cstdio>
#include<algorithm>
#include<cctype>
#include<set>
using namespace std;

const int maxn = 1000005;
int h[maxn], q[maxn];
int buffer[10];

void scan_d(int &x) {
    char ch = getchar();
    while(!isdigit(ch)) ch = getchar(); 
    x = 0;
    do {
        x = x * 10 + ch - '0';
        ch = getchar();
    }while(isdigit(ch));
} 

void print_d(int x) {
    if(x == 0) putchar('0');
    else {
        int p = 0;
        while(x) {
            buffer[p++] = x % 10 + '0'; 
            x = x/10;
        }
        for(int i = p-1; i >= 0; i--) 
            putchar(buffer[i]);
    }
    putchar('\n');
}

int main() {
    int n, m;
    while(scanf("%d%d", &n, &m) != EOF) {
        set<int> s;
        for(int i = 0; i < n; i++) scan_d(h[i]);
        for(int i = 0; i < m; i++) scan_d(q[i]);
        sort(h, h+n);
        for(int i = 0; i < m; i++) {
            if((s.empty() != 1) && s.count(q[i])) {print_d(0); continue;}
            int L = lower_bound(h, h+n, q[i]) - h;
            int R = upper_bound(h, h+n, q[i]) - h;
            s.insert(q[i]);
            print_d(R-L); 
        }
    }
    return 0;
}

HDU_5199

原文：http://blog.csdn.net/czkct/article/details/45649785