Solution-CF567-D2-A

#include <iostream>
#include <bits/stdc++.h>
#include <math.h>

using namespace std;

int main()
{
    int n=0;
    cin>>n;
    int allCordinates[n];
    for(int i=0;i<n;i++){
        cin>>allCordinates[i];
    }
    for(int i=0;i<n;i++){
        int minValue=0;
        int maxValue=0;
        if(i==0){
            minValue=abs(allCordinates[i]-allCordinates[i+1]);
            maxValue=abs(allCordinates[i]-allCordinates[n-1]);
        }
        else if(i==(n-1)){
            minValue=abs(allCordinates[i]-allCordinates[i-1]);
            maxValue=abs(allCordinates[i]-allCordinates[0]);
        }
        else{
            int temp1=abs(allCordinates[i]-allCordinates[i-1]);
            int temp2=abs(allCordinates[i]-allCordinates[i+1]);
            if(temp1>=temp2){
                minValue=temp2;
            }else{
                minValue=temp1;
            }

            int temp3=abs(allCordinates[i]-allCordinates[n-1]);
            int temp4=abs(allCordinates[i]-allCordinates[0]);
            if(temp3>=temp4){
                maxValue=temp3;
            }else{
                maxValue=temp4;
            }
        }
        cout<<minValue<<" "<<maxValue<<endl;
    }
    return 0;
}