UVA - 10041 Vito's Family (中位数)
2017-07-13 10:57
375 查看
题目大意:vito 的 r 个家人们住在街道 si……sr,问 vito 住在哪个街道去拜访亲戚的总距离最短,输出最短的总距离。距离dij=|si-sj|。
解题思路:取中位数,求各个数的差再求和
const int INF = 0x3f3f3f3f; //无穷大
const int NINF = -INF -1; //无穷小
解题思路:取中位数,求各个数的差再求和
#include<iostream> #include<stdio.h> #include<algorithm> #include<cmath> #include<string.h> const int INF = 0x3f3f3f3f; const int NINF = -INF -1; using namespace std; int s[510]; int T, r; int main() { scanf("%d", &T); while (T--) { scanf("%d", &r); for (int i = 0; i < r; i++) scanf("%d", &s[i]); sort(s, s+r); int mid = s[r/2]; int sum = 0; for (int i = 0; i < r; i++) sum += abs(s[i]-mid); printf("%d\n", sum); } return 0; }
const int INF = 0x3f3f3f3f; //无穷大
const int NINF = -INF -1; //无穷小
相关文章推荐
- UVA 10041 Vito's Family 求中位数 模拟
- UVA - 10041 Vito's Family 求中位数
- uva10041 - Vito's Family(求中位数)
- UVA 10041 Vito's Family (中位数)
- UVa 10041 Vito's Family (中位数&快速选择)
- UVa 10041 - Vito's Family
- uva10041-Vito‘s family(全部枚举)
- UVA - 10041 Vito's Family(贪心)
- UVa Problem 10041 Vito’s Family (Vito 家族)
- UVA 10041 Vito's Family (中位数)
- uva 10041 Vito's Family_贪心
- UVA10041 UVALive2202 Vito's Family【中位数+排序】
- UVa Problem Solution: 10041 - Vito's Family
- UVa 10041 Vito's Family (median selection)
- uva 10041 Vito's Family(检索)
- uva - 10041 - Vito's Family(数学)
- UVa 10041 - Vito's Family
- PC/UVa 题号:110401/10041 Vito's Family
- 第K小数 uva 10041 - Vito's Family poj 2388 Who's in the Middle
- uva 10041 - Vito's Family