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
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
using namespace std;
int T[5000005];
char C[5000005];
int main() {
    std::ios::sync_with_stdio(false);
    cin.tie(NULL);
    int n;
    cin >> n;
    for (int i=1;i<=n;i++)
    {
        cin >> T[i];
        C[i]=0;
    }
    T[0] = T[n+1] = 0;
    
    for (int i=1;i<=n;i++)
    {
        long long sum = T[i];
        int l=i-1;
        int r=i+1;
        while (l!=0 || r<=n)
        {
            if (l>0 && T[l]<sum)
            {
                sum+=T[l];
                l--;
                continue;
            }
            if (r<=n && T[r]<sum)
            {
                sum+=T[r];
                r++;
                continue;
            }
            break;
        }
        if (l==0 && r==n+1)
            C[i] = 'T';
        else
        {
            C[i]='N';
        }
    }
    
    for (int i=1;i<=n;i++) cout << C[i];
    cout << '\n';
}