algorithms

Algorithm implementations
git clone git://git.laack.co/algorithms.git
Log | Files | Refs | README

main.ml (736B)


      1 let readNext () = Scanf.scanf " %d" (fun x -> x) in
      2 let rec scanAll idx arr =
      3   if idx >= Array.length arr then ()
      4   else
      5     let next = readNext () in
      6     Array.set arr idx next;
      7     scanAll (idx + 1) arr
      8 in
      9 let solve arr =
     10   let soln = Array.make (Array.length arr) 0 in
     11   let rec acc idx =
     12     if idx = Array.length arr then 0
     13     else
     14       let best = acc (idx + 1) in
     15       if idx < Array.length arr - 1 && arr.(idx) <= arr.(idx + 1) then
     16         let () = soln.(idx) <- soln.(idx + 1) + 1 in
     17         max soln.(idx) best
     18       else
     19         let () = soln.(idx) <- 1 in
     20         max 1 best
     21   in
     22   acc 0
     23 in
     24 let numbers = readNext () in
     25 let arr = Array.make numbers 0 in
     26 let () = scanAll 0 arr in
     27 print_int (solve arr);
     28 print_newline ()