Codeforces 567A. Lineland Mail

简介:

Codeforces 567A的传送门

All cities of Lineland are located on the Ox coordinate axis. Thus, each city is associated with its position xi — 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 ​​mini and maxi, where mini is the minimum cost of sending a letter from the i-th city to some other city, and maxi 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 ≤ 105) — the number of cities in Lineland. The second line contains the sequence of n distinct integers x1, x2, …, xn ( - 109 ≤ xi ≤ 109), where xi is the x-coordinate of the i-th city. All the xi’s are distinct and follow in ascending order.

Output

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

Sample test(s)

Input
4
-5 -2 2 7

Output
3 12
3 9
4 7
5 12

Input
2
-1 1

Output
2 2
2 2

题目大意:给你n个有序的整数,让你找出与data[i]相距最大的数和最小的数

直接上代码:

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn=1e5+5;
int data[maxn];
int main()
{
    int m;
    while(~scanf("%d",&m))
    {
        for(int i=0; i<m; i++)
            scanf("%d",&data[i]);
        printf("%d %d\n",data[1]-data[0], data[m-1]-data[0]);
        for(int i=1; i<m-1; i++)
        {
            printf("%d %d\n",min(data[i]-data[i-1], data[i+1]-data[i])
                   ,max(data[m-1]-data[i],data[i]-data[0]));
        }
        printf("%d %d\n",data[m-1]-data[m-2],data[m-1]-data[0]);
    }
    return 0;
}
目录
相关文章
|
6月前
|
SQL XML 安全
BugKu CTF(Web):sqli-0x1 & baby lfi & baby lfi 2
BugKu CTF(Web):sqli-0x1 & baby lfi & baby lfi 2
|
测试技术
HDU-1847,Good Luck in CET-4 Everybody!(巴什博弈)
HDU-1847,Good Luck in CET-4 Everybody!(巴什博弈)
Contest Print Server组队第四场J
问题 J:Contest Print Server 时间限制: 1 Sec 内存限制: 128 MB 题目描述 In ACM/ICPC on-site contests ,3 students share 1 computer,so you can print your source code any time. Here you need to write a contest print server to handle all the requests.
86 0
|
前端开发 网络架构
HDU-1049 Climbing Worm
HDU-1049 Climbing Worm
转:肉饼的自白:You&#39;ve got to find what you love
《You've got to find what you love》是乔布斯2005年在斯坦福大学毕业典礼上的演讲,当我第一次看到这个演讲视频的时候,被彻底震住了。回顾自己跌跌撞撞的人生道路,就是一个不断寻找然后坚持自己钟爱事业的过程。
1373 0
|
机器学习/深度学习 Java 网络架构