?
听说Round #Pi的意思是Round #314。。。
?
?
A. Lineland Mail time limit per test：3 seconds memory limit per test：256 megabytes
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个点，求每个点到其他点的最近和最远距离
?
题目分析：往左往右取最大最小
?
?
#include
#include
using namespace std; int const MAX = 1e5 + 5; int a[MAX]; int main() { int n; scanf(%d, &n); for(int i = 0; i < n; i++) scanf(%d, &a[i]); printf(%d %d , a[1] - a[0], a[n - 1] - a[0]); for(int i = 1; i < n - 1; i++) printf(%d %d , min(a[i + 1] - a[i], a[i] - a[i - 1]), max(a[i] - a[0], a[n - 1] - a[i])); printf(%d %d , a[n - 1] - a[n - 2], a[n - 1] - a[0]); }
?
?
?
B. Berland National Library time limit per test：1 second memory limit per test：256 megabytes
Berland National Library has recently been built in the capital of Berland. In addition, in the library you can take any of the collected works of Berland leaders, the library has a reading room.
Today was the pilot launch of an automated reading room visitors' accounting system! The scanner of the system is installed at the entrance to the reading room. It records the events of the form reader entered room, reader left room. Every reader is assigned a registration number during the registration procedure at the library — it's a unique integer from 1 to 106. Thus, the system logs events of two forms:
+
r
i — the reader with registration number
r
i entered the room; -
r
i — the reader with registration number
r
i left the room.
The first launch of the system was a success, it functioned for some period of time, and, at the time of its launch and at the time of its shutdown, the reading room may already have visitors.
Significant funds of the budget of Berland have been spent on the design and installation of the system. Therefore, some of the citizens of the capital now demand to explain the need for this system and the benefits that its implementation will bring. Now, the developers of the system need to urgently come up with reasons for its existence.
Help the system developers to find the minimum possible capacity of the reading room (in visitors) using the log of the system available to you.
Input
The first line contains a positive integer n (1?≤?n?≤?100) — the number of records in the system log. Next follow n events from the system journal in the order in which the were made. Each event was written on a single line and looks as + ri or - ri, where ri is an integer from 1 to 106, the registration number of the visitor (that is, distinct visitors always have distin