TechoSagar: Find the Highest number

Search

Google Alert - jobs

Find the Highest number


Given an array with distinct elements in such a way that first the elements stored in array are in increasing order and then after reaching to a peak element , elements stored are in decreasing order. Find the highest element.
Input:
The first line of input contains an integer T denoting the number of test cases. The first line of each test case consists of an integer n. The next line consists ofn spaced integers. 
Output:
Print the highest number in the array.
Constraints: 
1<=T<=100
1<=n<=100
1<=a[i]<=105
Example:
Input:

2
11
1 2 3 4 5 6 5 4 3 2 1
9
1 3 4 5 7 8 9 5 2 
Output:
6
9

Your Code
#include<iostream>

using namespace std;

int main()
{
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
int a[100000];
int i;
for(i=0; i<n; i++)
{
cin>>a[i];
}
int mid=n/2;
int max=a[mid];
for(i=mid+1; i<n; i++)
{
if(a[i]<max)
{
break;
}
else
{
 max=a[i];
}
}
for(i=mid-1; i>=0; i--)
{
if(a[i]<max)
{
break;
}
else
{
max=a[i];
}
}
cout<<max<<endl;
}
}

Follow us

Follow Bijendra Kumar on Facebook