leaderInArray.cpp

/*Given an integer array A of size n. Find and print all the leaders present in the input array. An array element A[i] is called Leader, if all the elements following it (i.e. present at its right) are less than or equal to A[i].
Print all the leader elements separated by space and in the same order they are present in the input array.
Input Format :
Line 1 : Integer n, size of array
Line 2 : Array A elements (separated by space)
Output Format :
 leaders of array (separated by space)
Constraints :
1 <= n <= 10^6
Sample Input 1 :
6
3 12 34 2 0 -1
Sample Output 1 :
34 2 0 -1
Sample Input 2 :
5
13 17 5 4 6
Sample Output 2 :
17 6
*/

void Leaders(int* arr,int size)
{
	int max_from_right =  arr[size-1]; 
  
    /* Rightmost element is always leader */
    int arr2[10000000];
    arr2[0] = max_from_right;
    int c=1;
      
    for (int i = size-2; i >= 0; i--) 
    { 
        if (max_from_right <= arr[i]) 
        {            
            max_from_right = arr[i]; 
            arr2[c] = max_from_right;
            c++;
        } 
    } 
    for(int i=c-1; i>=0; i--){
        cout << arr2[i] << " ";
    }

}