90分tle求调
查看原帖
90分tle求调
1803776
sunhaochen2009楼主2025/8/3 18:44
#include<bits/stdc++.h>
using namespace std;
long long max1[1000009];
long long min1[1000009];
long long dl[1000009];
int main()
{
	int n,j;
	cin>>n>>j;
	for(int i=0;i<n;i++)
	{
		cin>>dl[i];
	}
	for(int i=0;i<=n-j;i++)
	{
		for(int i2=i;i2<i+j;i2++)
		{
			if(i2==i)
			{
				max1[i]=dl[i];
				min1[i]=dl[i];
				continue;
			}
			if(dl[i2]>max1[i])
			{
				max1[i]=dl[i2];
				continue;
			}
			if(dl[i2]<min1[i])
			{
				min1[i]=dl[i2];
				continue;
			}
		}
	}
	
	for(int i=0;i<=n-j;i++)
	{
		cout<<min1[i]<<" ";
	}
	cout<<endl;
	for(int i=0;i<=n-j;i++)
	{
		cout<<max1[i]<<" ";
	}
}
2025/8/3 18:44
加载中...