[hdu5200]离线+标记

思路：按顺序处理，新建一堆然后向左右合并，不过巧妙地用了标记数组来记录和统计答案。

#pragma comment(linker, "/STACK:10240000,10240000")

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <cstring>
#include <map>
#include <queue>
#include <deque>
#include <cmath>
#include <vector>
#include <ctime>
#include <cctype>
#include <set>

using namespace std;

#define mem0(a) memset(a, 0, sizeof(a))
#define lson l, m, rt << 1
#define rson m + 1, r, rt << 1 | 1
#define define_m int m = (l + r) >> 1
#define rep(a, b) for(int a = 0; a < b; a++)
#define all(a) (a).begin(), (a).end()
#define lowbit(x) ((x) & (-(x)))
#define constructInt4(name, a, b, c, d) name(int a = 0, int b = 0, int c = 0, int d = 0): a(a), b(b), c(c), d(d) {}
#define constructInt3(name, a, b, c) name(int a = 0, int b = 0, int c = 0): a(a), b(b), c(c) {}
#define constructInt2(name, a, b) name(int a = 0, int b = 0): a(a), b(b) {}
#define pc(a) putchar(a)
#define ps(a) puts(a)

typedef double db;
typedef long long LL;
typedef pair<int, int> pii;
typedef multiset<int> msi;
typedef multiset<int>::iterator msii;
typedef set<int> si;
typedef set<int>::iterator sii;
typedef vector<int> vi;

const int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
const int dy[8] = {0, -1, 0, 1, -1, 1, 1, -1};
const int maxn = 1e6 + 7;
const int maxm = 1e5 + 7;
const int maxv = 1e7 + 7;
const int max_val = 1e6 + 7;
const int MD = 1e9 +7;
const int INF = 1e9 + 7;
const double PI = acos(-1.0);
const double eps = 1e-10;

inline int ReadInt() {
    char c = getchar();
    while(!isdigit(c)) c = getchar();

    int x = 0;
    while(isdigit(c)) {
        x = x * 10 + c - '0';
        c = getchar();
    }
    return x;
}

inline void WriteInt(int i) {
    int p = 0;
    static int buf[10];
    if(i == 0) buf[p++] = 0;
    else while(i) {
        buf[p++] = i % 10;
        i /= 10;
    }
    for(int j = p - 1; j >= 0; j--) putchar('0' + buf[j]);
}


bool cmp(const pii &a, const pii &b) {
    return a.first > b.first;
}

int main() {
    //freopen("in.txt", "r", stdin);
    int n, q;
    while (cin >> n >> q) {
        vector<pii> a(n), b(q);
        vector<int> out(q);
        rep(i, n) {
            a[i].first = ReadInt();
            a[i].second = i;
        }
        rep(i, q) {
            b[i].first = ReadInt();
            b[i].second = i;
        }
        sort(all(a), cmp);
        sort(all(b), cmp);
        vector<bool> vis(n);
        int now = 0, ans = 0;
        rep(i, q) {
            while (now < n && a[now].first > b[i].first) {
                int pos = a[now].second;
                vis[pos] = true;
                ans++;
                if (pos && vis[pos - 1]) ans--;
                if (pos < n - 1 && vis[pos + 1]) ans--;
                now++;
            }
            out[b[i].second] = ans;
        }
        rep(i, q) {
            WriteInt(out[i]);
            pc('
');
        }
    }
    return 0;
}