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
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
// Karol Kosinski 2025
#include <bits/stdc++.h>
#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 X first
#define Y second
#define endl '\n'
#define NAM(x) #x,'=',x,"  "
using namespace std;
using LL = long long;
using ULL = unsigned long long;
using PII = pair<int, int>;
using TIII = tuple<int, int, int>;
template<class...T> void _cout(T...a){(cout<<...<<a);}

#ifndef ENABLE_DEBUG
#define DEB(k,p,f,x...)
#else
#define DEB(k,p,f,x...) {if(k)_cout("------",setw(4),__LINE__," : ",__FUNCTION__,endl);if(p)f(x);}
#endif
#define DEBF(f,x...)    DEB(1,1,f,x)
#define DEBL            DEBF(void,0)
#define DEBC(p,x...)    DEB(0,p,_cout,x)
#define DEBUG(x...)     DEBC(1,x)

constexpr int NX = 1'000'005;
constexpr int INFTY = 1'000'000'009;

int A[NX];//, B[NX];

bool solve()
{
    int n; cin >> n;
    FOR(i,0,n) cin >> A[i];
    int b = 0, e = n;
    while ( A[b] == 0 ) ++ b;
    while ( A[ e - 1 ] == 0 ) -- e;
    if ( e - b == 1 )
    {
        return A[b] == 1;
    }
    if ( e - b == 2 )
    {
        return abs( A[b] - A[ b + 1 ] ) <= 1;
    }
    FOR(i,b,e) if ( A[i] == 0 )
    {
        return false;
    }
    DEBL;
    DEBUG( "++ ", NAM(b), NAM(e), endl );

    int x = A[ e - 1 ], y0 = INFTY, y1 = INFTY, z0 = INFTY, z1 = INFTY;
    DEBUG( "** A[", e-1, "]=", A[e-1], endl );
    DEBUG( "**** ", NAM(x), NAM(y0), NAM(y1), NAM(z0), NAM(z1), endl );
    FD_( i, e - 2, b + 1 )
    {
        DEBUG( "** A[", i, "]=", A[i], endl );
        if ( A[i] < x and A[i] < y0 and A[i] < z0 )
        {
            DEBUG( "!!! A[i] < x, y0, z0\n" );
            return false;
        }
        int new_x = A[i] - x;
        int new_xy = new_x + 1;
        int new_xz = new_x + 2;
        int new_y0 = A[i] - y1 + 1;
        int new_y1 = A[i] - y0 + 1;
        int new_yz0 = new_y0 + 1;
        int new_yz1 = new_y1 + 1;
        int new_z0 = A[i] - z1 + 2;
        int new_z1 = A[i] - z0 + 2;

        if ( A[i] < new_xz) new_xz = -INFTY;
        if ( A[i] < new_yz0) new_yz0 = -INFTY, new_yz1 = -INFTY;
        else if ( A[i] < new_yz1) new_yz1 = A[i];
        if ( A[i] < new_z0) new_z0 = -INFTY, new_z1 = -INFTY;
        else if ( A[i] < new_z1) new_z1 = A[i];

        DEBUG( "++++++ ", NAM(new_x), NAM(new_xy), NAM(new_xz), endl );
        DEBUG( "++++++ ", NAM(new_y0), NAM(new_y1), NAM(new_yz0), NAM(new_yz1), endl );
        DEBUG( "++++++ ", NAM(new_z0), NAM(new_z1), endl );

        if ( new_x > 0 ) x = new_x;
        else x = INFTY;

        if ( new_xy > 0 or new_y1 > 0 )
        {
            y1 = max( new_xy, new_y1 );
            if ( new_xy > 0 )
            {
                if ( new_y0 > 0 )
                    y0 = min( new_y0, new_xy );
                else if ( new_y1 > 0 )
                    y0 = 1;
                else
                    y0 = new_xy;
            }
            else
            {
                if ( new_y0 > 0 )
                    y0 = new_y0;
                else
                    y0 = 1;
            }
        }
        else y0 = INFTY, y1 = INFTY;

        if ( new_xz > 0 or new_yz1 > 0 or new_z1 > 0 )
        {
            z1 = max( new_xz, max( new_yz1, new_z1 ) );
            if ( new_xz > 0 )
            {
                if ( new_yz1 > 0 )
                {
                    if ( new_z1 > 0 )
                    {
                        if ( new_yz0 > 0 and new_z0 > 0 )
                            z0 = min( new_xz, min( new_yz0, new_z0) );
                        else
                            z0 = 1;
                    }
                    else // new_yz1 > 0 and new_z1 <= 0
                    {
                        if ( new_yz0 > 0 )
                            z0 = min( new_xz, new_yz0 );
                        else
                            z0 = 1;
                    }
                }
                else // new_yz1 <= 0
                {
                    if ( new_z1 > 0 )
                    {
                        if ( new_z0 > 0 )
                            z0 = min( new_xz, new_z0 );
                        else
                            z0 = 1;
                    }
                    else // new_z1 <= 0 and new_yz1 <= 0
                    {
                        z0 = new_xz;
                    }
                }
            }
            else
            {
                if ( new_yz1 > 0 )
                {
                    if ( new_z1 > 0 )
                    {
                        if ( new_yz0 > 0 and new_z0 > 0 )
                            z0 = min( new_yz0, new_z0 );
                        else
                            z0 = 1;
                    }
                    else // new_yz1 > 0 and new_z1 <= 0
                    {
                        if ( new_yz0 > 0 )
                            z0 = new_yz0;
                        else
                            z0 = 1;
                    }
                }
                else // new_z1 > 0 and new_yz1 <= 0
                {
                    if ( new_z0 > 0 )
                        z0 = new_z0;
                    else
                        z0 = 1;
                }
            }
        }
        else z0 = INFTY, z1 = INFTY;

        DEBUG( "**** ", NAM(x), NAM(y0), NAM(y1), NAM(z0), NAM(z1), endl );
    }
    DEBUG( "** A[", b, "]=", A[b], endl );
    if ( A[b] == x - 1 or A[b] == x or A[b] == x + 1 ) return true;
    if ( y0 <= A[b] and A[b] <= y1 ) return true;
    if ( y0 - 1 <= A[b] and A[b] <= y1 - 1 ) return true;
    if ( z0 - 1 <= A[b] and A[b] <= z1 - 1 ) return true;
    return false;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int z; cin >> z;
    while ( z -- ) cout << ( solve() ? "TAK\n" : "NIE\n" );
    return 0;
}