SPOJ 297 — Aggressive cows (CODE: AGGRCOW)

Posted on 四月 21st, 2008.

求最大值最小,快排+二分答案.水题,不写题解.
1Y了,比较兴奋.
此题正好练习二分答案.发现在SPOJ上看别人AC哪道就做哪道也不是难事…不过这道题才0.1分…
{ SPOJ 297; Aggressive Cows; AGGRCOW - sqybi’s code - 快排+二分答案}//for my winstyprogram aggrcow_sqybi;  const    nn = 100000;
  var    cases, times, n, m, max, l, r, mid, ans, i: longint;    a: array[1..nn]of longint;
  procedure qsort(l, r: longint);    var      i, j, d, t: longint;    begin      i := l;      j := r;      d := a[(l+r) […]