[codeforces 1417C] k-Amazing Numbers

1417C

#include<bits/stdc++.h>
using namespace std;

const int maxn = 3e5+5;
int a[maxn],last[maxn],f[maxn],ans[maxn];


int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    int t;
    cin >> t;
    while(t--)
    {
        int n;
        cin >> n;
        for(int i = 1; i <= n ; i++){
            cin >> a[i];
            last[i] = f[i] = 0;
            ans[i] = -1;
        }
        for(int i = 1; i <= n; i++)
        {
            int x = a[i];
            f[x] = max(f[x], i - last[x]);
            last[x] = i;
        }
        for(int i = 1; i <= n; i++)
        {
            f[i] = max(f[i], n - last[i] + 1);
            for(int j = f[i]; j <= n && ans[j] == -1;j++)
                ans[j] = i;
        }
        for(int i = 1; i <= n; i++)
            cout << ans[i] << ' ';
        cout << endl;
    }
}