RightMaximum.cpp

/* 
AUTHOR: Antarikshya Mitra
TIME: 
PROBLEM NO:- Right Maximum
*/


#include<bits/stdc++.h>
using namespace std;
#define int long long 
#define endl '\n'
const int MOD = 1e9 + 7; 

void solve(vector<int> &arr)
{
    int n = arr.size();
    vector<pair<int,int>> prefix;

    int maxi = INT_MIN;
    int index = -1;

    for(int i=0;i<n;i++)
    {
        if(arr[i] >= maxi) {
            maxi = arr[i];
            index = i;
        }
        prefix.push_back({maxi,index});
    }

    struct pair_hash {
        size_t operator()(const pair<int,int>& p) const {
            return hash<int>()(p.first) ^ (hash<int>()(p.second) << 1);
        }
    };

    unordered_set<pair<int,int>, pair_hash> st;

    for(int i=0;i<n;i++)
    {
        st.insert(prefix[i]);
    }

    cout << st.size() << endl;
}
int32_t main()
{
	ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
	int t=1;
	cin>>t;
	while(t--)
	{
		int n;
		cin>>n;
		vector<int> arr(n);
		for (auto &a:arr) 
			cin>>a;
		solve(arr);
	}	
	return 0;
}