fun longestGrowingSubstringLength(array: List<Int>): Int {
  var maxLength = 1
  var currentLength = 1
 
  for (i in 1 until array.count()) {
    if (array[i] > array[i - 1]) {
      currentLength += 1
      if (currentLength > maxLength) {
        maxLength = currentLength
      }
    } else {
      currentLength = 1
    }
  }
 
  return maxLength
}
 
fun main() {
  val array = listOf(4, 9, 7, 2, 4, 7, 9, 3, 8, 6)
 
  val result = longestGrowingSubstringLength(array)
 
  println("Dlugosc najdluzszego rosnacego spojnego podciagu wynosi $result")
}

ZnVuIGxvbmdlc3RHcm93aW5nU3Vic3RyaW5nTGVuZ3RoKGFycmF5OiBMaXN0PEludD4pOiBJbnQgewogIHZhciBtYXhMZW5ndGggPSAxCiAgdmFyIGN1cnJlbnRMZW5ndGggPSAxCgogIGZvciAoaSBpbiAxIHVudGlsIGFycmF5LmNvdW50KCkpIHsKICAgIGlmIChhcnJheVtpXSA+IGFycmF5W2kgLSAxXSkgewogICAgICBjdXJyZW50TGVuZ3RoICs9IDEKICAgICAgaWYgKGN1cnJlbnRMZW5ndGggPiBtYXhMZW5ndGgpIHsKICAgICAgICBtYXhMZW5ndGggPSBjdXJyZW50TGVuZ3RoCiAgICAgIH0KICAgIH0gZWxzZSB7CiAgICAgIGN1cnJlbnRMZW5ndGggPSAxCiAgICB9CiAgfQoKICByZXR1cm4gbWF4TGVuZ3RoCn0KCmZ1biBtYWluKCkgewogIHZhbCBhcnJheSA9IGxpc3RPZig0LCA5LCA3LCAyLCA0LCA3LCA5LCAzLCA4LCA2KQoKICB2YWwgcmVzdWx0ID0gbG9uZ2VzdEdyb3dpbmdTdWJzdHJpbmdMZW5ndGgoYXJyYXkpCgogIHByaW50bG4oIkRsdWdvc2MgbmFqZGx1enN6ZWdvIHJvc25hY2VnbyBzcG9qbmVnbyBwb2RjaWFndSB3eW5vc2kgJHJlc3VsdCIpCn0=