Please check my code for maximum length bitonic subarray

#1

//BITONIC SUBARRAY LENGTH
#include
using namespace std;

void bitonic(int a[1000], int n){
int pass =0;
int maximum=0;
int lenght;
for(int i=0; i<n; i++){ //traversing the array
if( a[i+1] > a[i] ) //array is in ascending sorted
pass = 1;
else if( a[i+1] < a[i] ) //array is in descending sorted
pass = 1;
else { //array is bitonic
if(maximum < a[i])
maximum = a[i];
int l=0;
int r=n-1;
while(a[l]<maximum and a[r]<maximum){
pass=1;
l++;
r–;
}
}

if(pass == 1)
  lenght = sizeof(a)/sizeof(int);

    cout<<lenght<<endl;
}

}

int main()
{
int t;
cin>>t;
int n;
int a[n];
for(int i=0;i<t;i++){

cin>>n;

    for(int j=0;j<n;j++){
    cin>>a[j];
    }

}
bitonic(a,n);
return 0;
}