Antonio Gulli's coding playground

iven an array A[0 ... n-1] containing n positive integers, a subarray A[i ... j] is bitonic if there is a k with i <= k <= j such that A[i] <= A[i + 1] ... <= A[k]>= A[k + 1]>= .. A[j - 1]> = A[j]. Write a function that takes an array as argument and returns the length of the maximum length bitonic subarray.

Post a Comment

[フレーム]