A. Berstagram

http://codeforces.com/contest/1250/problem/A

#include <bits/stdc++.h>
//#include <queue>
//#include <cmath>
//#include <iostream>
//#include <unordered_map>

#define lson rt<<1
#define rson rt<<1|1
#define lowbit(x) ((x)&(-x))
#define mem(x,y) memset(x,y,sizeof(x))
#define pb push_back
#define INF 0x3f3f3f3f
#define ll long long
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;

const int mod=1e9+7;
const int N=5e5+9;

int a[N];
int b[N],pos[N];
int maxx[N],minn[N];
int main()
{
    FAST_IO;

    int n,m;
    cin>>n>>m;

    for(int i=1;i<=n;i++) maxx[i]=i,minn[i]=i;

    for(int i=1;i<=m;i++) cin>>a[i];

    for(int i=1;i<=n;i++) b[i]=i,pos[i]=i;

    for(int i=1;i<=m;i++)
    {
        int p=pos[a[i]];
        int val=a[i];

        if(p==1) continue;

        int ppos=p-1;
        int pval=b[ppos];

        swap(b[p],b[ppos]);
        swap(pos[val],pos[pval]);

        maxx[val]=max(maxx[val],ppos);
        minn[val]=min(minn[val],ppos);

        maxx[pval]=max(maxx[pval],p);
        minn[pval]=min(minn[pval],p);



    }

    for(int i=1;i<=n;i++) cout<<minn[i]<<' '<<maxx[i]<<endl;


    return 0;
}