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
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>

#define FOR(i, n) for(int i = 1; i <= n; i++)


std::vector<std::pair<int, int>> sumy;
std::vector<std::pair<int, int>> no_sort;

int main()
{
    std::ios_base::sync_with_stdio(0);
    std::cin.tie(0);
    int n;
    std::cin >> n;
    std::map<int, int> ilosc_sumow_rozmiaru_t;
    FOR(i, n) {
        int sum;
        std::cin >> sum;

        sumy.push_back(std::make_pair(sum, i));
        no_sort.push_back(std::make_pair(i, sum));

        if (ilosc_sumow_rozmiaru_t.count(sum)) {
            ilosc_sumow_rozmiaru_t[sum] += 1;
        }
        else {
            ilosc_sumow_rozmiaru_t[sum] = 1;
        }
    }
    std::sort(sumy.begin(), sumy.end());
    
    std::map<int, int> tab;
    int last = 0;
    int ile_razy = 1;

    bool prime = true;
    FOR(i, n) { // do poprawy

        if (last < sumy[i - 1].first) {
            tab[i] = tab[i - 1] + sumy[i - 1].first * ilosc_sumow_rozmiaru_t[sumy[i - 1].first];
            ile_razy = 1;
        }
        else {
            ile_razy++;
            tab[i] = tab[i - 1];
        }
        last = sumy[i - 1].first;
    }
    last = -1;



    int a = sumy[0].first;
    FOR(i, n) {
        if (sumy[i - 1].first == a) {
            tab[i] = a;
        }
    }


    // rozmiar, krol
    std::map<int, bool> krol;
    bool krolewski_bool = true;
    for(int i = n - 1 ; i >= 0; i--) {
        if (i == n - 1) {
            krol[sumy[i].first] = true;
        } else
        if (i + 1 <= n - 1)
            if(tab[i + 1] > sumy[i + 1].first && krolewski_bool) {
                krol[sumy[i].first] = true;
            }
            else {
                krol[sumy[i].first] = false;
                krolewski_bool = false;
            }
    }
    for (std::pair<int, int> pairs : no_sort) {
        std::cout << (krol[pairs.second] ? "T" : "N");
    }
    std::cout << std::endl;


}