TLE求指点

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
vector<LL>nums,min_nums,max_nums;
LL n,k,temp;
deque<LL>q_up,q_down;
int main()
{
	cin>>n>>k;
	for(int i=1;i<=n;i++)
	{
		cin>>temp;
		nums.push_back(temp);
	}
	LL  len=nums.size();
	LL r=0;
	while(r<len)
	{
		while(!q_up.empty()&&nums[q_up.back()]>=nums[r])
		{
			q_up.pop_back();
		}
		while(!q_down.empty()&&nums[q_down.back()]<=nums[r])
		{
			q_down.pop_back();
		}
		q_up.push_back(r);
		q_down.push_back(r);
		if(r!=k-1)
		{
			r++;
			continue;
		}
		if(r-q_up.front()>=k){
			q_up .pop_front();
		}
		if(r-q_down.front()>=k){
			q_down .pop_front();
		}
		min_nums.push_back(nums[q_up.front()]);
		max_nums.push_back(nums[q_down.front()]);
	 } 
	 for(LL x=1;x<=min_nums.size();x++)
	 {
	 	cout<<x<<" ";
	 }
	 cout<<endl;
	 for(LL x=1;x<=max_nums.size();x++)
	 {
	 	cout<<x<<" ";
	 }
    return 0;
}