【洛谷】P3865-ST表模板

 详细原理与实现（罗勇军）：倍增与ST算法 --算法竞赛专题解析（28） 

#include <iostream>
#include <cstdio>
using namespace std;

//倍增法打表(类dp)
//建表复杂度为o(nlog(n)),查询复杂度为o(1)
#define max(x, y) (x) > (y)? (x) : (y)
const int maxn = 1e5 + 5;
inline void read(int &x)
{
    register int f = 1;
    x = 0;
    register char c = getchar();
    while(c > '9' || c < '0')
    {
        if(c == '-') f = -1;
        c = getchar();
    }
    while(c >= '0' && c <= '9')
    {
        x = (x << 3) + (x << 1) + (c ^ 48);
        c  = getchar();
    }
    x *= f;
}

int n, m;
//dp[i][j], 代表以i为起点，长度为2^j的区间（包括i点）
int dp[maxn][20], lg[maxn];
void init()
{
    for(int j = 1; j <= 17; j++)
    {
//        i + (1 << j) - 1，减1是为了处理边界
        for(int i = 1; i + (1 << j) - 1 <= n; i++)
        {
            dp[i][j] = max(dp[i][j - 1], dp[i + (1 << j - 1)][j - 1]);
        }
    }
}

int main()
{
    read(n); read(m);
    for(int t, i = 1; i <= n; i++)
    {
        read(t);
//        2^0时候则是自己本身
        dp[i][0] = t;
    }
//    预处理lg函数的结果值，会比log2()要快，其结果是正确值+1
    for(int i = 1; i <= n; i++)
    {
        lg[i] = lg[i - 1] + (1 << lg[i - 1] == i);
    }
    init();
    for(int x, y, i = 1; i <= m; i++)
    {
        read(x); read(y);
        int len = lg[y - x + 1] - 1;
        printf("%d\n", max(dp[x][len], dp[y - (1 << len) + 1][len]));
    }
    return 0;
}

 //大佬提交的最优解：
//进行了最大程度的速度优化，可以学习一下

#include<bits/stdc++.h>
#define _SIZE_ 100000
char _b[_SIZE_],*_b1,*_b2;
#define getc() (_b1==_b2?fread(_b,1,_SIZE_,stdin),_b2=_b+_SIZE_,*((_b1=_b)++):*(_b1++))
#define read_(__x) register signed __x(0);{register char _c=getc();for(;_c<47;_c=getc());for(;_c>47;_c=getc())__x=__x*10+(_c^48);}
#define read__(__x) {__x=0;register char _c=getc();for(;_c<47;_c=getc());for(;_c>47;_c=getc())__x=__x*10+(_c^48);}
#define read(__x) {register signed _x(0);register char _c=getc();for(;_c<47;_c=getc());for(;_c>47;_c=getc())_x=_x*10+(_c^48);__x=_x;}
char _d[_SIZE_],*_p=_d;
#define putc(__c) (_p-_d==_SIZE_?fwrite(_d,1,_SIZE_,stdout),_p=_d,*_p++=__c:*_p++=__c)
#define write(__x) {register signed _x=__x;(_x<0)&&(putc(45),_x=-_x);static signed _q[11];register char _t=0;do{_q[_t++]=_x%10,_x/=10;}while(_x);while(_t)putc(_q[--_t]+48);}
#define fwflush() (fwrite(_d,1,_p-_d,stdout),_p=_d)
int st[17][100001],__tmp;
float*___tmp=(float*)&__tmp;
using namespace std;
signed main()
{
	read_(n);read_(m);
	for(int i=1;i<=n;i++)read(st[0][i]);
	for(int i=1;i<17;i++)for(register int j=1;j<=n;j++)st[i][j]=max(st[i-1][j],st[i-1][j+(1<<i-1)]);
	read_(l);read_(r);
	while(--m)
	{
		*___tmp=r-l+1;
		register int ll=l,rr=r;
		read__(l);read__(r);
		register int tmp=(__tmp>>23)+1&31;
		write(max(st[tmp][ll],st[tmp][rr-(1<<tmp)+1]));
		putc(10);
	}
	*___tmp=r-l+1;
	fwflush();
	register int tmp=(__tmp>>23)+1&31;
	printf("%d",(max(st[tmp][l],st[tmp][r-(1<<tmp)+1])));
	return 0;
}