Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- int main()
- {
- int t,n;
- cin>>t;
- while(t--)
- {
- cin>>n;
- int ar[n+1];
- for(int i=0; i<n; i++)
- {
- cin>>ar[i];
- }
- int mn = ar[n-1],c=0;
- int vis[n+1]= {0};
- for(int i=n-2; i>=0; i--)
- {
- if(ar[i]>mn&&vis[ar[i]]==0)
- {
- vis[ar[i]]=1;
- c++;
- mn=0;
- }
- else
- mn = ar[i];
- }
- int k=0;
- for(int i=n-1; i>=0; i--)
- {
- if(vis[ar[i]]==1)
- {
- k=i;
- break;
- }
- }
- set<int>s;
- for(int i=0; i<=k; i++)
- {
- s.insert(ar[i]);
- }
- if(n==1)
- cout<<1<<endl;
- else
- cout<<s.size()<<endl;
- s.clear();
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement