What approach should I use in this question , the approach I used below is giving wrong answer

See more:

C++

DSA

IPL Auctions are back. There are n players who will go under hammer in the sequence. There prices are given in a form an array in the order. A team wants to buy as much as player they can, but they have a condition that, they can only buy the current player if and only if the price of their last buyed player is less than the price of current player. Team can buy any player as their first player.

You need to find out the maximum player the team can buy following the above condition.

Input Format

First line of input contains an integer N, denoting the number of players in the auction.

Second line of input contains N space seperated integers denoting prices of players.

Constraints

1 ≤ N ≤ 10^5

0 ≤ A[i] ≤ 10^6

Output Format

The largest number of players they can buy

Sample Input :

6
5 8 3 7 9 1
Sample Output :
3

What I have tried:

#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    int n ; 
    cin>>n;
    int a[n];
    for(int i = 0;i<n;i++){
        cin>>a[i];
    }
    int mxcount = 0;
    for(int i = 0;i<n;i++){
        int  k = i;
         int count = 1;
        for(int  j = i;j<n;j++){
            
            if(a[j] > a[k]){
                count++;
                k++;
            }
        }
        mxcount = max(mxcount,count);
    }
    cout<<mxcount;
    return 0;
}