uva 10057 A mid-summer night’s dream
(|X1-A| + |X2-A| + … … + |Xn-A|) is minimum.
Input
Input will contain several blocks. Each block will start with a number n (0<n<=1000000) indicating how many numbers he saw in the dream. Next there will be n numbers. All the numbers will be less than 65536. The input will be terminated by end of file.
Output
For each set of input there will be one line of output. That line will contain the minimum possible value for A. Next it will contain how many numbers are there in the input that satisfy the property of A (The summation of absolute deviation from A is minimum). And finally you have to print how many possible different integer values are there for A (these values need not be present in the input). These numbers will be separated by single space.
Sample Input:
2
10
10
4
1
2
2
4
Sample Output:
10 2 1
2 2 1
题目大意:仲夏夜之梦!?一定是个高端大气的题目……题目要求求出最小的A,和n个数中可以满足A的个数,以及可以满足A的整数个数。
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<algorithm>
using namespace std;
int num[10000005];
int main() {
int n;
while (scanf("%d", &n) == 1) {
for (int i = 0; i < n; i++) {
scanf("%d", &num[i]);
}
sort(num, num + n);
int cnt = 0;
if (n % 2) {
for (int i = 0; i < n; i++) {
if (num[i] == num[n / 2]) cnt++;
}
printf("%d %d 1\n", num[n / 2], cnt);
} else {
for (int i = 0; i < n; i++) {
if (num[i] == num[n / 2] || num[i] == num[(n / 2) - 1]) cnt++;
}
printf("%d %d %d\n", num[(n / 2) - 1], cnt, num[n / 2] - num[(n / 2) - 1] + 1);
}
}
return 0;
}