#include <stdio.h>
void nearest_smaller_num(int arr[],int n)
{
char auxillary_array[n];
int min=arr[0];
int i;
for(i=1;i<n;i++)
{
if(arr[i-1]<arr[i]){
}
else if(min < arr[i]){
}
else {
min=arr[i];
}
if(arr[i-1]<min)
min=arr[i-1];
}
}
int main()
{
int arr[] = {1, 2, 3, 5, 4};
int n = sizeof(arr)/sizeof(arr[0]);
nearest_smaller_num(arr, n);
return 0;
}
I2luY2x1ZGUgPHN0ZGlvLmg+Cgp2b2lkIG5lYXJlc3Rfc21hbGxlcl9udW0oaW50IGFycltdLGludCBuKQp7CgljaGFyIGF1eGlsbGFyeV9hcnJheVtuXTsKCXByaW50ZigiXywgIik7CgkKCWludCBtaW49YXJyWzBdOwoJaW50IGk7Cglmb3IoaT0xO2k8bjtpKyspCgl7CgkgICAJaWYoYXJyW2ktMV08YXJyW2ldKXsKCSAgIAkJcHJpbnRmKCIlZCwgIixhcnJbaS0xXSk7CgkgICAJCQoJICAgCX0KCSAgIAllbHNlIGlmKG1pbiA8IGFycltpXSl7CgkgICAJCXByaW50ZigiJWQsICIsbWluKTsJCgkgICAJfQoJICAgCWVsc2UgewoJICAgCQlwcmludGYoIl8sICIsbWluKTsJCgkgICAJCW1pbj1hcnJbaV07CgkgICAJfQoJICAgCQoJCWlmKGFycltpLTFdPG1pbikKCQkgICBtaW49YXJyW2ktMV07Cgl9CgkKCQp9CgoKCmludCBtYWluKCkKewogICAgaW50IGFycltdID0gIHsxLCAyLCAzLCA1LCA0fTsKICAgIGludCBuID0gc2l6ZW9mKGFycikvc2l6ZW9mKGFyclswXSk7CiAgICBuZWFyZXN0X3NtYWxsZXJfbnVtKGFyciwgbik7CiAgICByZXR1cm4gMDsKfQkKCQo=