Need Help : Code Missing Special Cases

Contest Page | CodeChef → Problem link
Help me find the special cases plsssssssssssss :slight_smile:
//My code
#include <bits/stdc++.h>
using namespace std;

void solve()
{
long long int n; cin >> n;
long long int a[n],count[n],c=1;
fill_n(count, n, 1);
for(int i =0; i < n ; i++) cin>>a[i];
for(int i =1; i < n ; i++)
{
if(a[i-1]<a[i]) count[i] += count[i-1];
c += count[i];
}
cout<<c<<"\n";
}

int main() {
long long int t; cin>>t;
while(t–)
{
solve();
}
return 0;
}

In the problem statement, its mentioned that the subsequence must be non - decreasing. So, the condition has to be a[i-1]<=a[i].