RT,我的代码不是MLE3个点就是RE3个点，求问数组开多大（用的dp求RMQ）

#include<bits/stdc++.h>
using namespace std;
long long n,m,a[1000005],dp[1000005][20];
long long rmq(long long l,long long r){
	long long k=log2(r-l+1);
	return min(dp[l][k],dp[r-(1<<k)+1][k]);
}

int main(){
//	freopen("P1440_2.in","r",stdin);
	std::ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin>>n>>m;
	for(long long i=1;i<=n;i++){
		cin>>a[i];
		dp[i][0]=a[i];
	}
	for(long long j=1;j<=20&&(1<<j)<=n;j++){
		for(long long i=1;i+(1<<j)-1<=n;i++){
			dp[i][j]=min(dp[i][j-1],dp[i+(1<<j-1)][j-1]);
		}
	}
	cout<<0<<endl;
	for(long long i=1;i<=m;i++){
		cout<<rmq(1,i)<<endl;
	}
	for(long long i=m+1;i<n;i++){
		cout<<rmq(i-m+1,i)<<endl;;
	}
	return 0;
}