Maximum length biotonic subarray by me

according to the question i have done everything right…but after all that also, i am not getting the desired result…so please help me out …i am listing my code below

#include<bits/stdc++.h>
using namespace std;

int main() {
int t;
cin>>t;
while(t–){
int n;
cin>>n;
int arr[n];
int inc[n]={0};
int dec[n]={0};
for(int i=0;i<n;i++)
{
cin>>arr[i];
int j=i-1;
inc[0]=1;
if(arr[j]<arr[i])
inc[i+1]=inc[i]+1;
else
inc[i]=1;

}

for(int j=n-1;j>=0;j–)
{ dec[n-1]=1;
if(arr[j]>arr[j+1])
dec[j]=dec[j+1]+1;
else
dec[j]=1;

}
int maxa=inc[0]+dec[0];
for(int i=0;i<n;i++)
{
if((inc[i]+dec[i])>maxa)
maxa = inc[i]+dec[i];
}

cout<<(maxa-1)<<endl;
}
return 0;
}

Plz send your code by saving on ide only.