Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
find minimum in right sorted array
Language:
Ada
Assembly
Bash
C#
C++ (gcc)
C++ (clang)
C++ (vc++)
C (gcc)
C (clang)
C (vc)
Client Side
Clojure
Common Lisp
D
Elixir
Erlang
F#
Fortran
Go
Haskell
Java
Javascript
Kotlin
Lua
MySql
Node.js
Ocaml
Octave
Objective-C
Oracle
Pascal
Perl
Php
PostgreSQL
Prolog
Python
Python 3
R
Rust
Ruby
Scala
Scheme
Sql Server
Swift
Tcl
Visual Basic
Layout:
Vertical
Horizontal
def find_min(A, n): l, r = 0, n-1 while l < r: m = (l+r) // 2 if A[l] > A[m]: if A[m] < A[m+1] and A[m] < A[m-1]: return A[m] r = m - 1 else: if A[m] < A[r]: return A[l] else: l = m + 1 return A[r] def main(): for _ in range(int(input())): n = int(input()) A = list(map(int, input().split())) print(find_min(A, n)) if __name__ == '__main__': main()
1 6 5 8 9 19 28 3
[
-
]
Show input
Absolute running time: 0.23 sec, cpu time: 0.06 sec, memory peak: 8 Mb, absolute service time: 0,44 sec
edit mode
|
history
|
discussion
3