「2017 山东一轮集训 Day2」Pair(线段树+尺取)

#include <iostream>
#include <cstring>
#include <cstdio>
#include <queue>
#include <cstdlib>
#include <cmath>
#include <stack>
#include <map>
#include <string>
#include <vector>
#include <set>
#include <bitset>
#include <algorithm>
#include <ctime>
#include <tr1/unordered_map>
using namespace std;
#define ll long long
#define lb long double
#define INF 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f3f
#define ull unsigned long long
#define endl '\n'
#define clr(a, b) memset(a, b, sizeof(a))
#define lowbit(x) x & -x
#define lson rt << 1, l, mid
#define rson rt << 1 | 1, mid + 1, r
#define PB push_back
#define POP pop_back
#define max_ll 9223372036854775807
#define random(x) (rand() % x)
#define y1 yyy1
#define y2 yyy2
// srand((ll)time(0));
// freopen("E://one.txt","r",stdin); //输入重定向，输入数据将从in.txt文件中读取
// freopen("E://oneout.txt","w",stdout); //输出重定向，输出数据将保存在out.txt文件中
// tr1::unordered_map<int,int>mp;
const double EPS = 1e-8;
const double pi = acos(-1);
const int maxn = 2e5 + 10;
const int maxm = (maxn << 5) + 5;
const ll mod = 1e9 + 7;
const int hash_mod = 19260817;
int n, m, k;
int mi[maxn << 2], lazy[maxn << 2], a[maxn], b[maxn], R[maxn];
void build(int rt, int l, int r) {
    if (l == r) {
        mi[rt] = -(m - l + 1);
        return;
    }
    int mid = (l + r) >> 1;
    build(lson);
    build(rson);
    mi[rt] = min(mi[rt << 1], mi[rt << 1 | 1]);
}
void pushdown(int rt) {
    if (lazy[rt]) {
        lazy[rt << 1] += lazy[rt];
        lazy[rt << 1 | 1] += lazy[rt];
        mi[rt << 1] += lazy[rt];
        mi[rt << 1 | 1] += lazy[rt];
        lazy[rt] = 0;
        return;
    }
}
void update(int rt, int l, int r, int L, int R, int k) {
    if (L <= l && r <= R) {
        lazy[rt] += k;
        mi[rt] += k;
        return;
    }
    pushdown(rt);
    int mid = (l + r) >> 1;
    if (L <= mid)
        update(lson, L, R, k);
    if (R > mid)
        update(rson, L, R, k);
    mi[rt] = min(mi[rt << 1], mi[rt << 1 | 1]);
}
int main() {
    scanf("%d %d %d", &n, &m, &k);
    for (int i = 1; i <= m; ++i) {
        scanf("%d", &b[i]);
        b[i] = k - b[i];
    }
    sort(b + 1, b + 1 + m);
    build(1, 1, m);
    for (int i = 1; i <= n; ++i) {
        scanf("%d", &a[i]);
        a[i] = upper_bound(b + 1, b + 1 + m, a[i]) - b - 1;
    }
    int t = 1;
    for (int i = 1; i <= n; ++i) {
        while (t <= n && mi[1] < 0) {
            update(1, 1, m, 1, a[t++], 1);
        }
        if (mi[1] >= 0)
            R[i] = t - 1;
        else
            R[i] = -1;
        update(1, 1, m, 1, a[i], -1);
    }
    int cnt = 0;
    for (int i = 1; i <= n; ++i) {
        if (R[i] - i + 1 == m && R[i] <= n)
            cnt++;
    }
    cout << cnt;
    return 0;
}