Description

Let’s define an array element arr[i] is beautiful if there’s no element before arr[i] is greater than arr[i].In the other words, if arr[i] is beautiful, then arr[i] < arr[j] is false for all 0 ≤ j < i.

Your task is to find the largest beautiful element.

 

Hints:The variable used to record largest beautiful element should be initialized small enough

 

#include<stdio.h> int main(){ int N; int arr[1000]; int i,j; //read array elements and store in arr ??? int ans = ??? ; for(i=???; ???; ???){ int is_beautiful = ???; //a flag for element arr[i] for(j=???; ???; ???){ //check if there exists a larger element arr[j] before arr[i] if( ??? ){ is_beautiful = ???; } } if( is_beautiful == ??? && ans < ??? ) //update the largest beautiful number ??? } printf("%d\n", ans); return 0; }

Input

The first line contains an integer N, meaning the size of array. The second line contains N integers, denoting each element in array.

• 1 <= n <= 1000
• 1 <= array elements <= 100000

Output

Print the largest beautiful element.
Remember to print ‘\n’ on the end of each line.

Sample Input  Download

Sample Output  Download

Tags

Add Tag

Discuss