[ifrog] Round #19 B -- Buildings

n

http://www.ifrog.cc/acm/problem/1149?contest=1021&no=1

注意到这个题是可以尺取的，尺取的时候用线段树或其它数据结构高效查询区间最值，复杂度就是 o(nlogn)

#include<stdio.h>
#include<math.h>
#include<string.h>
#include<queue>
#include<algorithm>
using namespace std;

typedef long long LL;
const int INF = 0x3f3f3f3f;

const int MAXN = 2e5 + 5;
int arr[MAXN], dp[MAXN], n, k;
int mii[MAXN<<2], maa[MAXN<<2];

void build(int k, int l, int r) {
    if(l == r) mii[k] = maa[k] = arr[l];
    else {
        build(k<<1, l, (l+r)/2);
        build(k<<1|1, (l+r)/2 + 1, r);
        mii[k] = min(mii[k<<1], mii[k<<1|1]);
        maa[k] = max(maa[k<<1], maa[k<<1|1]);
    }
}

void query(int k, int ll, int rr, int l, int r, int &maaa, int &miii) {
    if(l > rr || r < ll) return ;
    if(ll <= l && r <= rr) {
        maaa = max(maaa, maa[k]);
        miii = min(miii, mii[k]);
        return ;
    }
    query(k<<1, ll, rr, l, (l+r)/2, maaa, miii);
    query(k<<1|1, ll, rr, (l+r)/2 +1, r, maaa, miii);
}

int main()
{
    scanf("%d%d", &n, &k);
    for(int i = 1; i <= n; ++i) {
        scanf("%d", arr + i);
    }
    build(1, 1, n);
    int low = 1, top = 1, ma, mi;
    LL ans = 0;
    while(top <= n) {
        --low;
        do {
            ++low;
            ma = 0, mi = 1e9;
            query(1, low, top, 1, n, ma, mi);
        }while(ma - mi > k) ;
    //  printf("[%d %d] -> [%d %d]\n", low, top, ma, mi);
        ans += top - low + 1;
        ++top;
    }
    printf("%lld\n", ans);
    return 0;
}