Max length of bitonic subarray

WHATS WRONG IN THIS CODE

#include
using namespace std;
int bio(int a[],int n)
{
int inc[1000],dec[1000],max;
inc[0]=1;
dec[n-1]=1;

for(int i=1;i<n;i++)
    inc[i]=(a[i]>a[i-1])?inc[i-1]+1:1;

for(int i=n-2;i>=0;i--)
    dec[i]=(a[i]>=a[i+1])?dec[i+1]+1:1;

max=inc[0]+dec[0]-1;
for(int i=0;i<n;i++)
    if(inc[i]+dec[i]-1>max)
        max=inc[i]+dec[i]-1;
return max;

}

int main()
{
int t,n;
int a[1000]={0};
cin>>t;
if(t>=1 and t<=100)
for(int i=0;i<t;i++)
{
cin>>n;
if(n>=1 and n<=1000000)
for(int i=0;i<n;i++)
cin>>a[i];
cout<<bio(a,n)<<endl;
}
return 0;
}

@LPU11910344
hello shauray,
increase ur inc and dec array size.