Sun, 10 Feb 2019 13:11:33 GMT

C279991/.tutorial.md

@@ -76,4 +76,6 @@ multiset搞一下（又忘记clear了）
 
 [原版题解：CF822D](http://codeforces.com/blog/entry/53068)
 
-明天再简要翻译一下吧，t(天)q(气)l(冷)，w(我)s(睡)l(了)。
+### Q - Lineland Mail
+
+超级无敌水题。。。。。

C279991/CMakeLists.txt

@@ -2,7 +2,7 @@
 cmake_minimum_required(VERSION 3.0)
 set(CMAKE_CXX_STANDARD 17)
 if(MSVC)
-    add_compile_options("/Zc:__cplusplus" "/wd6031")
+    add_compile_options("/Zc:__cplusplus" "/wd6031" "/wd6385")
 endif()
 include_directories("C:\\Users\\Administrator\\AppData\\Local\\Programs\\MSYS2\\mingw64\\include\\c++\\8.2.1\\x86_64-w64-mingw32")
 add_executable(A A.cpp)

C279991/Q.cpp

@@ -2,7 +2,17 @@
 #define _SILENCE_CXX17_C_HEADER_DEPRECATION_WARNING
 #include <bits/stdc++.h>
 using namespace std;
+const int N = 1e5 + 50;
+int a[N];
 int main()
 {
+    int n;
+    scanf("%d", &n);
+    for (int i = 0; i < n; i++)
+        scanf("%d", a + i);
+    printf("%d %d\n", a[1] - a[0], a[n - 1] - a[0]);
+    for (int i = 1; i < n - 1; i++)
+        printf("%d %d\n", min(a[i] - a[i - 1], a[i + 1] - a[i]), max(a[i] - a[0], a[n - 1] - a[i]));
+    printf("%d %d\n", a[n - 1] - a[n - 2], a[n - 1] - a[0]);
     return 0;
 }