Question

lifics
Coding
<<
Caution! Please do not move away from the window or refresh. You may be marked as suspicious
1
Question No. 1 of 1 14 Marks
JAVA (1.8)
V
1
Numbers Game
2
3
NOTE : Class Nane should be Main
You are given an array A of Nintegers. Now, two functions F(X) and G(X) are defined:
F(X): This is the smallest number Z such that X<Zs N and A[X] <A[Z]
G(X): This is the smallest number Z such that X<Zs N and A[X] > A[Z]
11 -
Now, you need to find for each index i of this array G(F(i)), where 1sisN. If such a number does not exist,
for a particular index i, output 1 as its answer. If such a number does exist, output A[G[F[]}]]
4
5
6. import java.io.*;
7 import java.util.";
8- class Main
9 public static void main(String[] args) throus I
10
List<String> inputByLine = new ArrayListot
try {
12
// Get the object of DatainputStream
13
InputStreamReader isr = new InputStream
14
BufferedReader br - new BufferedReader
15
String line = "";
16 -
while ((line - br.readLine()) != null)
17
inputByLine.add(line.toString();
18
}
19
for (String line2 inputByLine)
System.out.println(line2);
20
21
isr.close();
} catch (IOException loe) {
22
ioe.printStackTrace();
23
Input :
The first line contains a single integer N denoting the size of array A. Each of the next N lines contains a
single integer, where the integer on the ith line denotes A[i].
Output :
Print N space separated integers on a single line, where the ith integer denotes A[G[F]]]]] or 1, if G[FO]
24
does not exist.
)
1
25
26 }
Constraints:
15N<30000
O<A[i]$10^18
Sample Input
8
3
7​

Answer 1

Answer:

vvvvvfhf j Refugio I have to give my uncle today because he will go to Canada for life time of the African American Horror Story hotel episode of the African American Horror Story episode of my life dear siso jaan me Pauchli lower Parel West Virginia and you can even

Explanation:

confidential and may the coming year provide you with all that brings you happiness today and always will