Lineland Mail CodeForces - 567A

题意：求a1.....an与其他数的最大差值和最小差值

因为是严格递增的  注意左右端点的最大最小值就够了。

#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<math.h>
using namespace std;
bool compare(int a, int b)
{
	return a>b;
}
int cmp(const void *a, const void *b)
{
	return *(char *)a - *(char *)b;
}
bool composite(int i)
{
	if (i == 1) return false;
	else if (i == 2 || i == 3) return true;
	else for (int j = 2;j<sqrt((float)i) + 1;j++)
	{
		if (i%j == 0)
			return true;
	}
	return false;
}
int max(int a1, int a2)
{
	return a1 = a1>a2 ? a1 : a2;
}
int father[1001];
void initial(int n)
{
	for (int i = 1;i <= n;i++)
		father[i] = i;

}
int find(int a)
{
	while (father[a] != a)
		a = father[a];
	return a;
}
void combine(int a, int b)
{
	int temp1 = find(a);
	int temp2 = find(b);
	if (temp1 != temp2)
		father[temp1] = temp2;


}
long a[100001], b[100001], c[100001];
inline int bitcount(int x) {
	return x == 0 ? 0 : bitcount(x >> 1) + (x & 1);
}

int main()
{
	ios::sync_with_stdio(false);
	int n;
	while (cin >> n)
	{
		for (int i = 0;i < n;i++)
		{
			cin >> a[i];
		}
		b[0] = a[n - 1] - a[0];b[n - 1] = b[0];//max
		c[0] = a[1] - a[0];c[n - 1] = a[n - 1] - a[n - 2];//min
		for (int i = 1;i < n-1;i++)
		{
			b[i] = max(a[i] - a[0], a[n - 1] - a[i]);
			c[i] = min(a[i+1] - a[i], a[i] - a[i-1]);
		}
		for (int i = 0;i < n;i++)
			cout << c[i] << ' ' << b[i] << endl;
	}
	
	
	
}