Problem - 1554A - Codeforces

You are given n 𝑛 integers a 1 , a 2 ,…, a n 𝑎 1 , 𝑎 2 , … , 𝑎 𝑛 . Find the maximum value of max( a l , a l+1 ,…, a r )⋅min( a l , a l+1 ,…, a r ) 𝑚 𝑎 𝑥 ( 𝑎 𝑙 , 𝑎 𝑙 + 1 , … , 𝑎 𝑟 ) ⋅ 𝑚 𝑖 𝑛 ( 𝑎 𝑙 , 𝑎 𝑙 + 1 , … , 𝑎 𝑟 ) over all pairs (l,r) ( 𝑙 , 𝑟 ) of integers for which 1≤l<r≤n 1 ≤ 𝑙 < 𝑟 ≤ 𝑛 . The first line contains a single integer t 𝑡 ( 1≤t≤10000 1 ≤ 𝑡 ≤ 10 000 )  — the number of test cases. The first line of each test case contains a single integer n 𝑛 ( 2≤n≤ 10 5 2 ≤ 𝑛 ≤ 10 5 ). The second line of each test case contains n 𝑛 integers a 1 , a 2 ,…, a n 𝑎 1 , 𝑎 2 , … , 𝑎 𝑛 ( 1≤ a i ≤ 10 6 1 ≤ 𝑎 𝑖 ≤ 10 6 ). It is guaranteed that the sum of n 𝑛 over all test cases doesn't exceed 3⋅ 10 5 3 ⋅ 10 5 . For each test case, print a single integer  — the maximum possible value of the product from the statement. Let f(l,r)=max( a l , a l+1 ,…, a r )⋅min( a l , a l+1 ,…, a r ) 𝑓 ( 𝑙 , 𝑟 ) = 𝑚 𝑎 𝑥 ( 𝑎 𝑙 , 𝑎 𝑙 + 1 , … , 𝑎 𝑟 )

saved by

• Arush Agrawal