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
#include <bits/stdc++.h>
 
using namespace std;
 
#define endl '\n'
#define L long long
#define MP make_pair
#define REP(i, n) for(int i = 0; i < n; ++i)
#define REPR(i, n) for(int i = n - 1; i >= 0; --i)
#define FOR(i, a, b) for(int i = a; i < b; ++i)
#define FORR(i, a, b) for(int i = b - 1; i >= a; --i)
#define EB emplace_back
#define ST first
#define ND second
#define S size
#define RS resize
 
template<class T> using P = pair<T, T>;
template<class T> using V = vector<T>;

bool solve() {
    int n;
    cin >> n;
    V<int> a(n);
    REP(i, n) {
        cin >> a[i];
    }

    int l = 0, r = n - 1;
    while (l < r && a[l] == 0) {
        l++;
    }
    while (l < r && a[r] == 0) {
        r--;
    }

    if (l == r && a[l] <= 1) {
        return true;
    }

    FOR(i, l + 1, r) {
        if (a[i] == 0) {
            return false;
        }
    }

    while (l < r && a[l] < a[l + 1]) {
        a[l + 1] -= a[l];
        l++;
    }

    if (l == r) {
        return a[l] == 1;
    }

    while (l < r && a[r] < a[r - 1]) {
        a[r - 1] -= a[r];
        r--;
    }

    if (l == r) {
        return a[l] == 1;
    }

    if (a[l] > a[l + 1] || a[r] > a[r - 1]) {
        return false;
    }

    while (l < r && a[l] <= a[l + 1]) {
        a[l + 1] -= a[l] - 1;
        l++; 
    }

    return l == r && a[l] == 1;
}
 
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int t;
    cin >> t;
    REP(i, t) {
        if (solve()) {
            cout << "TAK\n";
        } else {
            cout << "NIE\n";
        }
    }
}

// g++ -std=c++20 -Wall -Wextra -Wshadow -Wconversion -D_GLIBCXX_DEBUG wyl.cpp -o wyl