ugly code

gistfile1.scala

  val memo = HashMap[(Int, Int), (Int, Int)]((0, 0) -> (0, 0))
  def cost(from: Int, to: Int): (Int, Int) = {
    if (memo.contains((from, to))) {
      memo((from, to))
    } else if (to - from < 1) {
      (to, 0)
    } else if (to - from < 3) {
      (Math.max(0, to - 1), Math.max(0, to - 1))
    } else {
      val costList = (from to to).map(i => (Math.max(cost(from, i - 1)._2, cost(i + 1, to)._2) + i))
      val result = (costList.lastIndexOf(costList.min) + 1, costList.min)
      memo += (((from, to), (result)))
      result
    }
  }