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
56
57
58
59
60
61
62
63
64
// Karol Kosinski 2021
#include <bits/stdc++.h>
// #define ENABLE_DEBUG
#define FOR(i,a,b) for(int i=(a),_b=(b);i<_b;++i)
#define FR_(i,a,b) for(int i=(a),_b=(b);i<=_b;++i)
#define FD_(i,b,a) for(int i=(b),_a=(a);i>=_a;--i)
#define ALL(c) (c).begin(),(c).end()
#define SIZE(c) int((c).size())
#define TIE(x...) int x;tie(x)
#define X first
#define Y second
#ifndef ENABLE_DEBUG
#define DEB(k,f,x...)
#else
#define DEB(k,f,x...) {if(k)printf("--------%4d : %s\n",__LINE__,__FUNCTION__);f(x);}
#endif
#define DEBL DEB(1,void,0)
#define DEBF(f,x...) DEB(1,f,x)
#define DEBUG(x...) DEB(0,printf,x)
using namespace std;
using LL = long long;
using ULL = unsigned long long;
using PII = pair<int, int>;
using TIII = tuple<int, int, int>;

constexpr int NX = 500'003;

int S[NX];
char Res[NX];
map<int, int> MCount;
map<int, LL, greater<int>> MSum;
map<int, char> MRes;

int main()
{
    int n;
    scanf("%d", &n);
    FOR(i,0,n)
    {
        scanf("%d", S + i);
        ++ MCount[ S[i] ];
        MRes[ S[i] ] = '-';
    }
    LL sum = 0;
    for ( auto& it : MCount )
    {
        sum += LL(it.X) * it.Y;
        MSum[it.X] = sum;
        DEBUG("* %3d -> %3d %lld\n", it.X, it.Y, MSum[it.X]);
    }
    LL prev = MSum.begin() -> X;
    MRes.rbegin() -> Y = 'T';
    MRes.begin() -> Y = 'N';
    for ( auto& iter : MSum ) if ( MRes[iter.X] == '-' )
    {
        DEBUG("+ %3d -> %3d < %lld\n", iter.X, prev, iter.Y);
        if ( prev < iter.Y ) MRes[iter.X] = MRes[prev];
        else MRes[iter.X] = 'N';
        prev = iter.X;
    }
    FOR(i,0,n) Res[i] = MRes[ S[i] ];
    printf("%s\n", Res);
    return 0;
}