linelandTLE

#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <algorithm>
typedef long long int ll;
using namespace std;

int main(int argc, char* argv[]){
    ll n;
    scanf("%Ld",&n);
    ll array[n];// = (ll*)malloc(sizeof(ll)*n);
    for(ll i=0;i<n;i++){
        scanf("%Ld",array+i);
    }
    ll mi, ma;
    ll low = 0;
    ll high = n-1;
    for(ll i=0;i<n;i++){
        if(i == 0){
            mi = array[i+1] - array[i];
        }
        else if(i == n-1){
            mi = array[i] - array[i-1];
        }
        else{
            mi = min(array[i+1] - array[i], array[i] - array[i-1]);
        }
        ma = max(array[i] - array[low] , array[high] - array[i]);

        printf("%Ld %Ld\n", mi, ma);
    }
    return 0;
}