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
#include <bits/stdc++.h>
#include <random>
#define ll long long int
#define pb push_back
#define st first
#define nd second
#define pii pair<int,int>
#define mp make_pair
#define pll pair<long long,long long>
#define ld long double
#define ull unsigned long long

using namespace std;

const int nax = 5e5 + 5;
ll a[nax];
ll pref[nax];
int n;

ll ask(int lo, int hi){
    if(lo > hi) return 0LL;
    return pref[hi] - pref[lo - 1];
}

ll orig[nax];

void solve(){
    cin >> n;
    for(int i=1;i<=n;i++) cin >> a[i];
    ll mi = a[1];
    for(int i=1;i<=n;i++) mi = min(mi, a[i]);
    for(int i=1;i<=n;i++) orig[i] = a[i];
    sort(a + 1, a + n + 1);
    if(mi == a[n]){
        for(int i=1;i<=n;i++) cout << "N";
        cout << "\n";
        return;
    }
    for(int i=1;i<=n;i++) pref[i] = pref[i - 1] + a[i];
    set<int> can;
    can.insert(a[n]);
    for(int i=n-1;i>=1;i--){
        if(a[i] == mi) break;
        if(pref[i] <= a[i + 1]) break;
        can.insert(a[i]);
    }
    for(int i=1;i<=n;i++){
        if(can.count(orig[i])) cout << "T";
        else cout << "N";
    }
    cout << "\n";
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);

    int tt = 1;
    // cin >> tt;
    while(tt--) solve();

    return 0;
}