Codeforces 567A Lineland Mail

最新推荐文章于 2019-06-11 11:29:02 发布

yphacker

最新推荐文章于 2019-06-11 11:29:02 发布

阅读量838

点赞数

分类专栏： ------非常简单的签到题------ 文章标签：水题

本文链接：https://blog.csdn.net/piaocoder/article/details/47335109

版权

------非常简单的签到题------ 专栏收录该内容

65 篇文章

订阅专栏

Lineland Mail

题目链接：

http://codeforces.com/problemset/problem/567/A

官方题解：

One can notice that the maximum cost of sending a letter from i'th city is equal to maximum of distances from i'th city to first city and fromi'th city to last (max(abs(xi - x0), abs(xi - xn - 1)). On the other hand, the minimum cost of sending a letter will be the minimum of distances between neighboring cities (i - 1'th and i + 1'th cities), more formally, min(abs(xi - xi - 1), abs(xi - xi + 1). For each city, except the first and the last this formula is correct, but for them formulas are (abs(xi - xi + 1)) and (abs(xi - xi - 1)) respectively.

AC代码：

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;

typedef long long ll;
ll a[100005];

int main(){
    int n;
    while(~scanf("%d",&n)){
        for(int i = 0; i < n; i++)
            scanf("%lld",&a[i]);
        printf("%lld %lld\n",a[1]-a[0],a[n-1]-a[0]);
        for(int i = 1; i < n-1; i++)
            printf("%lld %lld\n",min(a[i]-a[i-1],a[i+1]-a[i]),max(a[i]-a[0],a[n-1]-a[i]));
        printf("%lld %lld\n",a[n-1]-a[n-2],a[n-1]-a[0]);
    }
    return 0;
}