样例过了，结果全错，0分

#include<bits/stdc++.h>
using namespace std;
const int Maxn = 1000000;
int n,m,u,v,a[Maxn],arr[Maxn];
int main()
{
	freopen("1.in","r",stdin);
	scanf("%d%d",&n,&m);
	for(int i = 0;i < m*2;i+=2)
	{
		scanf("%d%d",&u,&v);
		a[i] = u;
		a[i+1] = v;
	}
	for(int i = 1;i <= n;i++)
	{
		int s = 0;
		for(int j = 0;j < m*2;j++)
		{
			if(s == 0 && a[j] == i)
			{
				s = 1;
				continue;
			}
			else if(s == 1 && a[j] == i)
			{
				a[j] = 0;
			}
		}
	}
	int k = 0;
	for(int i = 0;i < m*2;i++)
	{
		if(a[i] == 0) continue;
		arr[k] = a[i];
		k++;
	}
	for(int i = 1;i <= n;i++)
	{
		int maxn = 0,idx;
		for(int j = 0;j < k;j++)
		{
			if(arr[j] == i)
			{
				idx = j;
			}
		} 
		for(int j = idx;j < k;j++)
		{
			maxn = max(arr[j],maxn);
		}
		printf("%d ",maxn);
	}
	return 0;
}