题目链接:https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=998
题意:其实就是给定数轴上n个点,求一个点与所有点的距离之和最小
思路:这个数一定是中位数,然后根据奇偶分别计算下就可以了。。做麻烦了 orz (代码没什么价值)
AC代码:
#include <bits/stdc++.h>
using namespace std;
const int INF = 2147483647;
const int MAXN = 1e6 + 5;
int cnt[100000], cnt2[65539];
int main() {
int n;
while (~scanf("%d", &n)) {
memset(cnt, 0, sizeof(cnt));
long long sum = 0;
int mm = 0;
for (int i = 0; i < n; i++) {
int t;
scanf("%d", &t);
mm = max(mm, t);
sum += t;
cnt[t]++;
}
cnt2[0] = cnt[0];
for (int i = 1; i <= mm; i++) {
cnt2[i] = cnt2[i - 1] + cnt[i];
}
long long ans = sum, ans2 = 0, ans3 = cnt[0], ans4 = 1;
for (int i = 1; i <= mm; i++) {
sum += 2 * cnt2[i - 1];
sum -= cnt2[mm];
if (sum < ans) {
ans = sum;
ans2 = i;
ans4 = 1;
ans3 = cnt[i];
}
else if (sum == ans) {
ans3 += cnt[i];
ans4++;
}
}
printf("%lld %lld %lld\n", ans2, ans3, ans4);
}
return 0;
}