567A - Lineland Mail

#include <iostream>

#include<vector>

#include<string>

#include<math.h>

#include<map>

#include<algorithm>

/***** S. M. Sabiul Hajjaj Sabit *****/

using namespace std;

template <typename T>long long int power(T a, T b)

{

    long long int pow=1;

    for(int i=0; i<b; i++)

    {

        pow *= a;

    }

    return pow;

}

///*********Write Code From Here*********///

int main()

{

    int n;

    vector<long long int>arr;

    cin>>n;

    long long int mn=9999999999;

    long long int mx=-999999999;

    for(int i=0; i<n; i++)

    {

        int t;

        cin>>t;

        arr.push_back(t);

    }

    for(int i=0; i<arr.size(); i++)

    {

        if(i>0)

        {

            mn =min(abs(arr[i]-arr[i-1]),abs(arr[i]-arr[i+1]));

        }

        else if(i==0)

        {

            mn = abs(arr[i]-arr[i+1]);

        }

        if(i>=0)

        {

            mx =max(abs(arr[i]-arr[n-1]),abs(arr[i]-arr[0]));

        }

        else if(i==n-1)  mx =abs(arr[i]-arr[0]);

        cout<<mn<<" "<<mx<<endl;

    }

}