Chef gives an array A with N elements to Babla. Babla's task is to find the maximum non-negative integer X such that: No element in the array belongs to the range[−X,X]. In other words, for all (1≤i≤N), either Ai<−X or Ai>X. Help Babla to find the maximum non-negative integer X for which the given condition is satisfied or determine if no such X exists. Input Format The first line of input will contain a single integer T, denoting the number of test cases. Each test case consists of multiple lines of input. The first line of each test case contains an integer N — the number of elements in the array. The second line of each test case contains N space-separated integers A1,A2,…,AN representing the array A. Output Format For each test case, output on a new line, the maximum non-negative integer X, satisfying the above condition. If no such X exists, output −1 instead. Constraints 1≤T≤105 1≤N≤105 −109≤Ai≤109 Sum of N over all test cases does not exceed 2⋅105.
Chef gives an array A with N elements to Babla. Babla's task is to find the maximum non-negative integer X such that: No element in the array belongs to the range[−X,X]. In other words, for all (1≤i≤N), either Ai<−X or Ai>X. Help Babla to find the maximum non-negative integer X for which the given condition is satisfied or determine if no such X exists. Input Format The first line of input will contain a single integer T, denoting the number of test cases. Each test case consists of multiple lines of input. The first line of each test case contains an integer N — the number of elements in the array. The second line of each test case contains N space-separated integers A1,A2,…,AN representing the array A. Output Format For each test case, output on a new line, the maximum non-negative integer X, satisfying the above condition. If no such X exists, output −1 instead. Constraints 1≤T≤105 1≤N≤105 −109≤Ai≤109 Sum of N over all test cases does not exceed 2⋅105.
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
Chef gives an array A with N elements to Babla. Babla's task is to find the maximum non-negative integer X such that:
- No element in the array belongs to the range[−X,X]. In other words, for all (1≤i≤N), either
Ai <−X or Ai>X.
Help Babla to find the maximum non-negative integer X for which the given condition is satisfied or determine if no such X exists.
Input Format
- The first line of input will contain a single integer T, denoting the number of test cases.
- Each test case consists of multiple lines of input.
- The first line of each test case contains an integer N — the number of elements in the array.
- The second line of each test case contains N space-separated integers A1,A2,…,AN representing the array A.
Output Format
For each test case, output on a new line, the maximum non-negative integer X, satisfying the above condition.
If no such X exists, output −1 instead.
Constraints
- 1≤T≤105
- 1≤N≤105
- −109≤Ai≤109
- Sum of N over all test cases does not exceed 2⋅105.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 2 images
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education