hacktoberfest2020/fightForladdus.cpp at master · anXcode/hacktoberfest2020 · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
#include<iostream>
#include<bits/stdc++.h>
using namespace std;

int main()
{

    int n,t;
    cin>>t;
    while(t--){
    cin>>n;
    int a[n],next[n],k[n];
    int has[100002]={0};
    stack<int>s;
    for(int i=0;i<n;i++)
        cin>>a[i];
    for(int i=0;i<n;i++)
    {
        has[a[i]]++;
    }
    for(int i=0;i<n;i++)
    {
        k[i]=has[a[i]];
    }
    for(int i=n-1;i>=0;i--)
    {


        while(!(s.empty())&&(k[s.top()]<=k[i]))
        {

           // next[i]=s.top();
            s.pop();
        }
        if(!s.empty())
            next[i]=s.top();
        else
            next[i]=-1;
        s.push(i);
    }
    for(int i=0;i<n;i++)
    {
        if(next[i]==-1)
            cout<<-1<<" ";
        else
        {
            cout<<a[next[i]]<<" ";
        }
    }
    cout<<endl;
    }


}