HDU 5289 Assignment【ST+二分】

2015多校第1场，题意：问有多少个子区间符合 区间最大-最小 < K，题目上的Hints是下标表示。

枚举区间左端点，二分右端点，ST算法求最值查，让右端点尽量往右，因为大区间的最大值能满足的话它的子区间肯定也能满足。即最小值最大化问题。

#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
#define ll long long
#define eps 10^(-6)
#define Q_CIN ios::sync_with_stdio(false);
#define REP( i , n ) for ( int i = 0 ; i < n ; ++ i )
#define FOR( i , a , b ) for ( int i = a ; i <= b ; ++ i )
#define CLR( a , x ) memset ( a , x , sizeof (a) );
#define RE freopen("1.in","r",stdin);
#define WE freopen("1.out","w",stdout);
#define MOD 10009
#define bug(x) cout<<#x<<":"<<(x)<<endl;


const int maxn = 100003;
const int inf = 1e9 + 5;
int h[maxn];
int maxdp[maxn][22], mindp[maxn][22];
int n, m;
void initST()
{
    int i, j, t;
    for (i = 1; i <= n; i++)
    {
        maxdp[i][0] = h[i];
        mindp[i][0] = h[i];
    }
    for (j = 1; (1 << j) <= n; j++)
    {
        for (i = 1; i + (1 << j) - 1 <= n; i++)
        {
            t = i + (1 << (j - 1));  //注意+比<<优先级高
            maxdp[i][j] = max(maxdp[i][j - 1], maxdp[t][j - 1]);
            mindp[i][j] = min(mindp[i][j - 1], mindp[t][j - 1]);
        }
    }
}

int rmq(int l, int r)
{
    int k, mx, my;
    k = (int)(log(r - l + 1.0) / log(2.0));
    mx = max(maxdp[l][k], maxdp[r - (1 << k) + 1][k]);
    my = min(mindp[l][k], mindp[r - (1 << k) + 1][k]);
    return mx - my;
}
int read()
{
    int x = 0, f = 1; char ch = getchar();
    while (ch < '0' || ch > '9') {if (ch == '-')f = -1; ch = getchar();}
    while (ch >= '0' && ch <= '9') {x = x * 10 + ch - '0'; ch = getchar();}
    return x * f;
}
int k;
bool ok(int l, int mid)
{
    if (rmq(l, mid) < k)
        return true;
    return false;
}
int main()
{
    int t;
    scanf("%d", &t);
    while (t--) {
        scanf("%d%d", &n, &k);
        for (int i = 1; i <= n; ++i) {
            h[i] = read();
        }
        initST();
        ll cnt = 0;
        for (int i = 1; i <= n; ++i) {
            int L = i, R = n;
            while (L < R){
                int mid = (L + R + 1) / 2;
                if (ok(i, mid))
                    L = mid;
                else
                    R = mid - 1;
            }
            cnt += L - i + 1;
        }
        printf("%lld\n", cnt);
    }
    return 0;
}

其中

int mid = (L + R + 1) / 2;

如果不加1，在L+1==R的情况可能死循环，因为L一直没更新。

二分部分也可以写成

int mid,ans;
while(L<=R)
{
    mid=(L+R)/2;
    if(ok(i,mid))      
    {
        L=mid+1;
        ans=mid;        //记录当前值
    }
    else
        R=mid-1;
}
cnt+=ans-i+1;