Poj 2388 Who's in the Middle 寻找第k大数
来源:互联网 发布:淘宝开零食店无法上架 编辑:程序博客网 时间:2024/06/16 11:14
FJ is surveying his herd to find the most average cow. He wants to know how much milk this 'median' cow gives: half of the cows give as much or more than the median; half give as much or less.
Given an odd number of cows N (1 <= N < 10,000) and their milk output (1..1,000,000), find the median amount of milk given such that at least half the cows give the same amount of milk or more and at least half give the same or less.
---------------------------------------------------------------------------分割线-----------------------------------------------------------
显然题目简化后,就是求寻找第k大数。qsort改动一下即可。
var a:array[1..1000000] of longint; i,n:longint;function divi(l,r:longint):longint;var mid,x,i,j:longint; begin randomize; mid:=random(r-l+1)+l; x:=a[mid];a[mid]:=a[l]; i:=l;j:=r; while i<j do begin while (i<j) and (a[j]>=x) do dec(j);if i<j then begin a[i]:=a[j];inc(i);end; while (i<j) and (a[i]<=x) do inc(i);if i<j then begin a[j]:=a[i];dec(j);end; end; if i=n div 2 then exit(x); if n div 2<i then exit(divi(l,mid-1)) else exit(divi(mid+1,r));end;begin read(n); for i:=1 to n do read(a[i]); writeln(divi(1,n));end.
0 0
- Poj 2388 Who's in the Middle 寻找第k大数
- 第K小数 uva 10041 - Vito's Family poj 2388 Who's in the Middle
- poj 2388 Who's in the Middle 第K大的数 线性时间选择
- POJ--2388 Who's in the Middle
- poj 2388 Who's in the Middle
- POJ-2388 who's in the middle
- poj-2388 Who's in the Middle
- poj 2388 Who's in the Middle
- POJ 2388 Who's in the Middle
- poj 2388 Who's in the Middle
- POJ 2388 Who's in the Middle
- Poj 2388 Who's in the Middle
- POJ 2388 Who's in the Middle
- POJ 2388 Who's in the Middle
- poj 2388 Who's in the Middle
- POJ-2388-Who's in the Middle
- poj 2388 Who's in the Middle
- POJ 2388 Who's in the Middle
- python学习手册(3)
- Reactor(反应器)模式初探
- 一个关于空气质量采集系统的设计与实现
- vue笔记。Demo 1
- Unity3D开发小贴士(九)序列化和反序列化Dictionary
- Poj 2388 Who's in the Middle 寻找第k大数
- 数据结构学习笔记1
- crack me160题 第十四题(序号130)phox.3 分析
- shell通过telnet调用http和smtp协议
- Vivado HLs中任意精度数据类型的处理方法
- onStartCommand返回值
- IE兼容实现HTML5的placeholder
- 子集生成算法 之 位向量法和增量构造法
- 413. Arithmetic Slices 【M】