Question: in c++ B. Palindrome Array time limit per test: 1 second memory limit per test: 256 megabytes input: standard input output: standard output Given a
B. Palindrome Array time limit per test: 1 second memory limit per test: 256 megabytes input: standard input output: standard output Given a number N and an array A of N numbers. Determine if it's palindrome or not. Note: An array is called palindrome if it reads the same backward and forward, for example, arrays \{ 1 \} and (1,2,3,2,1) are palindromes, while arrays {1,12} and {4,7,5,4} are not. Input First line contains a number N(1N105) number of elements. Second line contains N numbers (1Ai10). Output Print 'YES' (without quotes) if A is a palindrome array, otherwise, print 'NO' (without quotes). The following languages are only available languages for the problems from the contest E-learning before spring - Sheet \#1: - Cianga+20 Diagnostics - Ciang++17 Diagnostics - GNU G++146.4.0 - GNU Gi+177.3.0 - GNU G++20 11.2.0 (64 bit, winlibs) - Microsoft Visual C++2017 - GNU G++179.2,0 (64 bit, msys 2) Virtual participation Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported enly ICPC mode for virtual contests. If you've seen these problems, a virtual contest is not for you solve these problems in the archive. If you
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
