Codeforces 567A 567B 567C 567D

最新推荐文章于 2022-03-29 23:31:56 发布

置顶

VIP文章 sky_miange

最新推荐文章于 2022-03-29 23:31:56 发布

阅读量6.6k

点赞数 1

分类专栏： CodeForces 文章标签： ACM算法

本文链接：https://blog.csdn.net/sky_miange/article/details/47340569

版权

All cities of Lineland are located on the Ox coordinate axis. Thus, each city is associated with its position x_i — a coordinate on the Ox axis. No two cities are located at a single point.

Lineland residents love to send letters to each other. A person may send a letter only if the recipient lives in another city (because if they live in the same city, then it is easier to drop in).

Strange but true, the cost of sending the letter is exactly equal to the distance between the sender's city and the recipient's city.

For each city calculate two values min_i and max_i, where min_i is the minimum cost of sending a letter from the i-th city to some other city, and max_i is the the maximum cost of sending a letter from the i-th city to some other city

Input

The first line of the input contains integer n (2 ≤ n ≤ 10⁵) — the number of cities in Lineland. The second line contains the sequence of n distinct integers x₁, x₂, ..., x_n ( - 10⁹ ≤ x_i ≤ 10⁹), where x_i is the x-coordinate of the i-th city. All the x_i's are distinct and follow in ascending order.

Output

Print n lines, the i-th line must contain two integers min_i, max_i, separated by a space, where min_i is the minimum cost of sending a letter from the i-th city, and max_i is the maximum cost of sending a letter from the i-th city.

Sample test(s)

Input

4-5 -2 2 7

Output

3 123 94 75 12

Input

2-1 1

Output

2 22 2

题意就是找每个点距离最小和最大的，排序后。对于最小的，显然只有找它旁边的两个，对于最大的，找第一个和最后一个，注意，第一个和最后一个特判一下就好

#include<iostream>
#include<cstdio>
#include<cstring>
#include<math.h>
#include<algorithm>
using namespace std;
#define N 500005
typedef long long ll;
#include <queue>
#include <set>
#include <map>
#include <stack>
int main()
{
    int n,i;
    while(scanf("%d",&n)!=EOF)
    {
        int a[200005];
        memset(a,0,sizeof(a));
        for(i=0; i<n; i++)
        {
            scanf("%d",&a[i]);
        }
        sort(a,a+n);