九度oj 1349 数字在排序数组中出现的次数

原题链接：http://ac.jobdu.com/problem.php?pid=1349 
二分。。

 #include<algorithm>
 #include<iostream>
 #include<cstdlib>
 #include<cstdio>
 using std::lower_bound;
 using std::upper_bound;
 const int Max_N = ;
 int arr[Max_N];
 int main() {
 #ifdef LOCAL
     freopen("in.txt", "r", stdin);
     freopen("out.txt", "w+", stdout);
 #endif
     int n, m, v;
     while (~scanf("%d", &n)) {
         for (int i = ; i < n; i++) scanf("%d", &arr[i]);
         scanf("%d", &m);
         while (m--) {
             scanf("%d", &v);
             printf("%d\n", upper_bound(arr, arr + n, v) - lower_bound(arr, arr + n, v));
         }
     }
     return ;
 }