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
#include<bits/stdc++.h>

using namespace std;

const int N = 5e5+3;

typedef long long ll;

int n;
unordered_map<ll,bool> ans;
ll T[N+3],T2[N+3],sp[N+3];

int main()
{
	
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	
	cin>>n;
	for(int i = 1;i<=n;++i)
	{
		cin>>T[i];
		T2[i] = T[i];
	}
	sort(T+1,T+n+1);
	for(int i = 1;i<=n;++i){
		sp[i] = T[i]+sp[i-1];
	}
	ll mn = 1e10;
	for(int i = n;i>=1;--i){
		mn = min(T[i],mn);
	}
	if(mn == T[n]){
		for(int i =1 ;i<=n;++i){
			cout<<"N";
		}
		return 0;
	}
	for(int i = n;i>=1;--i){
		if(T[i] > mn){
			if(sp[i] > T[i+1]){
				ans[T[i]] = 1;
			}else{
				break;
			}
		}
	}	
	for(int i = 1;i<=n;++i){
		if(ans.find(T2[i])==ans.end()){
			cout<<"N";
		}else{
			cout<<"T";
		}
	}
	return 0;
	
}