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
#include <iostream>
#include <vector>
using namespace std;

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t, n, a;

    cin >> t;
    for (int test = 0; test < t; test++)
    {
        cin >> n;
        vector<int> zabawki;
        zabawki.reserve(n);
        int maks = -1;
        for (int i = 0; i < n; i++)
        {
            cin >> a;
            zabawki.push_back(a);
            if (a > maks)
                maks = a;
        }

        int l = 0;
        while (zabawki[l] == 0)
        {
            l++;
        }
        int r = n - 1;
        while (zabawki[r] == 0)
        {
            r--;
        }

        if (l - r < -2 && (zabawki[l] > zabawki[l + 1] || zabawki[r] > zabawki[r - 1]))
        {
            cout << "NIE\n";
            continue;
        }

        while (l < r)
        {
            if ((zabawki[l] <= zabawki[l + 1]))
            {
                zabawki[l + 1] -= zabawki[l];
                zabawki[l] = 0;
                l++;
            }
            else if ((zabawki[r] <= zabawki[r - 1]))
            {
                zabawki[r - 1] -= zabawki[r];
                zabawki[r] = 0;
                r--;
            }
            else if (zabawki[l] > zabawki[l + 1] && zabawki[r] > zabawki[r - 1])
            {
                cout << "NIE\n";
                break;
            }
        }
        if (l == r)
        {
            if (zabawki[l] != 1 && zabawki[l] != 0)
                cout << "NIE\n";
            else
                cout << "TAK\n";
        }
    }
}