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
#include <cstdio>
#include <algorithm>
using namespace std;

int A[1000000];

int main()
{
  int t, n;
  scanf("%i ", &t);
  while (t--)
  {
    scanf("%i ", &n);
    for (int i = 0; i<n; i++) scanf("%i ", A+i);
    for (int i = 0, l = 0; i<n-1; i++)
    {
      int m = min(A[i]-l, A[i+1]-1);
      if (m>0) A[i] -= m, A[i+1] -=m;
      if (A[i]>0) l = 1;
    }
    for (int i = n-1, l = 0; i>0; i--)
    {
      int m = min(A[i]-l, A[i-1]-1);
      if (m>0) A[i] -= m, A[i-1] -=m;
      if (A[i]>0) l = 1;
    }
    int p = 0, q = 0, f = 0;
    for (int i = 0; i<n; i++)
    {
      if (A[i]!=p) p = A[i], q++;
      if (A[i]>1 || q>2) {f = 1; break;}
    }
    puts(f? "NIE": "TAK");
  }
  return 0;
}