/*
 * Copyright 2020 <NAME>
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *      http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

package dev.shtanko.algorithms.leetcode

import java.awt.Point

fun interface MaximumWidthRampStrategy {
    operator fun invoke(arr: IntArray): Int
}

class MaximumWidthRampSort : MaximumWidthRampStrategy {
    override fun invoke(arr: IntArray): Int {
        val n: Int = arr.size
        val b = Array(n) { 0 }
        for (i in 0 until n) {
            b[i] = i
        }
        b.sortWith { i, j ->
            arr[i].compareTo(arr[j])
        }
        var ans = 0
        var m = n
        for (i in b) {
            ans = ans.coerceAtLeast(i - m)
            m = m.coerceAtMost(i)
        }

        return ans
    }
}

class MaximumWidthRampBinarySearch : MaximumWidthRampStrategy {
    override fun invoke(arr: IntArray): Int {
        val n: Int = arr.size
        if (n == 0) return 0
        var ans = 0
        val candidates: MutableList<Point> = ArrayList()
        candidates.add(Point(arr[n - 1], n - 1))

        // candidates: i's decreasing, by increasing value of A[i]
        for (i in n - 2 downTo 0) {
            // Find largest j in candidates with A[j] >= A[i]
            var lo = 0
            var hi = candidates.size
            while (lo < hi) {
                val local = hi - lo
                val mi = lo + local / 2
                if (candidates[mi].x < arr[i]) lo = mi + 1 else hi = mi
            }
            if (lo < candidates.size) {
                val j: Int = candidates[lo].y
                ans = ans.coerceAtLeast(j - i)
            } else {
                candidates.add(Point(arr[i], i))
            }
        }
        return ans
    }
}

/*
 * Copyright 2020 Oleksii Shtanko
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *      http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

package dev.shtanko.algorithms.leetcode

import java.awt.Point

fun interface MaximumWidthRampStrategy {
    operator fun invoke(arr: IntArray): Int
}

class MaximumWidthRampSort : MaximumWidthRampStrategy {
    override fun invoke(arr: IntArray): Int {
        val n: Int = arr.size
        val b = Array(n) { 0 }
        for (i in 0 until n) {
            b[i] = i
        }
        b.sortWith { i, j ->
            arr[i].compareTo(arr[j])
        }
        var ans = 0
        var m = n
        for (i in b) {
            ans = ans.coerceAtLeast(i - m)
            m = m.coerceAtMost(i)
        }

        return ans
    }
}

class MaximumWidthRampBinarySearch : MaximumWidthRampStrategy {
    override fun invoke(arr: IntArray): Int {
        val n: Int = arr.size
        if (n == 0) return 0
        var ans = 0
        val candidates: MutableList<Point> = ArrayList()
        candidates.add(Point(arr[n - 1], n - 1))

        // candidates: i's decreasing, by increasing value of A[i]
        for (i in n - 2 downTo 0) {
            // Find largest j in candidates with A[j] >= A[i]
            var lo = 0
            var hi = candidates.size
            while (lo < hi) {
                val local = hi - lo
                val mi = lo + local / 2
                if (candidates[mi].x < arr[i]) lo = mi + 1 else hi = mi
            }
            if (lo < candidates.size) {
                val j: Int = candidates[lo].y
                ans = ans.coerceAtLeast(j - i)
            } else {
                candidates.add(Point(arr[i], i))
            }
        }
        return ans
    }
}
