题目链接:点击进入
题目
思路
ST 表是解决 RMQ 问题 ( 区间最值问题 ) 的一种强有力的工具
O ( n log n ) 预处理,O ( 1 ) 查询最值
minn [ i ] [ j ] 表示,从 i 位置开始的
2
j
2^j
2j 个数中的最小值,也就是 a [ i ] ~ a [ i + 2 ^ j - 1 ] 中的最小值
初始化 minn [ i ] [ 0 ] = a [ i ]
转移方程 minn [ i ] [ j ] = min ( minn [ i ] [ j - 1] , minn [ i + (1 << j - 1 ) ] [ j - 1] )
查询 min ( dp [ l ] [ k ] , dp [ r - (1 << k ) + 1 ] [ k ] )( 查询 [ l , r ] 内的最小值,k = log2 ( r - l + 1 ) )
代码
// Problem: P2251 质量检测
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/P2251
// Memory Limit: 125 MB
// Time Limit: 1000 ms
//
// Powered by CP Editor (https://cpeditor.org)
//#pragma GCC optimize(3)//O3
//#pragma GCC optimize(2)//O2
#include<iostream>
#include<string>
#include<map>
#include<set>
//#include<unordered_map>
#include<queue>
#include<cstdio>
#include<vector>
#include<cstring>
#include<stack>
#include<algorithm>
#include<iomanip>
#include<cmath>
#include<fstream>
#define X first
#define Y second
#define best 131
#define INF 0x3f3f3f3f3f3f3f3f
#define pii pair<int,int>
#define lowbit(x) x & -x
#define inf 0x3f3f3f3f
//#define int long long
//#define double long double
//#define rep(i,x,y) for(register int i = x; i <= y;++i)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const double pai=acos(-1.0);
const int maxn=1e6+10;
const int mod=1e9+7;
const double eps=1e-9;
const int N=5e3+10;
/*--------------------------------------------*/
inline int read()
{
int k = 0, f = 1 ;
char c = getchar() ;
while(!isdigit(c)){if(c == '-') f = -1 ;c = getchar() ;}
while(isdigit(c)) k = (k << 1) + (k << 3) + c - 48 ,c = getchar() ;
return k * f ;
}
/*--------------------------------------------*/
int n,m,a[maxn];
int minn[maxn][21];
int query(int l,int r)
{
int k=log2(r-l+1);
return min(minn[l][k],minn[r-(1<<k)+1][k]);
}
int main()
{
// ios::sync_with_stdio(false);
// cin.tie(0);cout.tie(0);
cin>>n>>m;
for(int i=1;i<=n;i++) cin>>a[i];
for(int i=1;i<=n;i++) minn[i][0]=a[i];
for(int j=1;(1<<j)<=n;j++)
for(int i=1;i+(1<<j)-1<=n;i++)
minn[i][j]=min(minn[i][j-1],minn[i+(1<<(j-1))][j-1]);
for(int i=1;i+m-1<=n;i++)
cout<<query(i,i+m-1)<<endl;
return 0;
}