66B - Petya and Countryside

#include <iostream>

#include<vector>

#include<string>

#include<math.h>

#include<set>

#include<map>

#include<list>

#include<stack>

#include<queue>

#include <fstream>

#include<iterator>

#include<algorithm>

#include <iomanip>      // std::setprecision

/* ==================================================

  |                                                  |

  |    Author: *** S. M. Sabiul Hajjaj Sabit ***     |

  |       Last Edit:  May,14,2019                    |

   ================================================== */

///***global declaration***///

#define all(arr) arr.begin(),arr.end()

#define pb push_back

#define lb lower_bound

#define up upper_bound

#define sz(x) x.size()

#define min3(a,b,c)  min(min(a,b),c)

#define max3(a,b,c)  max(max(a,b),c)

#define lli long long int

using namespace std;

int i,j,n,m,sum=0,ans=0;

template <typename T>long long int power(T a, T b)

{

    long long int pow=1;

    for(int i=0; i<b; i++)

        pow *= a;

    return pow;

}

/////*********Write Code From Here*********///

int  main()

{

    vector<int> arr;

    int n;

    cin>>n;

    for(int i=0; i<n; i++)

    {

        int t;

        cin>>t;

        arr.pb(t);

    }

    int max=0;

    for(int i=0; i<sz(arr); i++)

    {

        int left=i;

        int right = i+1;

        int data = arr[i],data_max=0;

        while(left>=0 && data>=arr[left])

        {

            data = arr[left];

            left--;

            data_max++;

        }

        data = arr[right];

        while(right<sz(arr) && data>=arr[right] )

        {

            data = arr[right];

            right++;

            data_max++;

        }

        if(max<data_max) max= data_max;

    }

    cout<<max<<endl;

}