#include<bits/stdc++.h>
using namespace std;
const int MAXN = 1000 * 1000 + 17;
int a[MAXN];
int a2[MAXN];
int b[MAXN];
void czysc (int n) {
for (int i = 1; i <= n; i ++) {
a[i] = 0;
a2[i] = 0;
b[i] = 0;
}
}
void rozw () {
int n;
cin >> n;
int N = n;
for (int i = 1; i <= n; i ++) {
cin >> a[i];
}
int pocz = 1;
while (a[pocz] == 0 && pocz <= n) {
pocz ++;
}
int kon = n;
while (a[kon] == 0 && kon >= 1) {
kon --;
}
for (int i = pocz; i <= kon; i ++) {
a2[i - pocz + 1] = a[i];
}
n = kon - pocz + 1;
for (int i = 1; i <= n; i ++) {
a[i] = a2[i];
}
if (n == 1) {
if (a[1] == 1) {
cout << "TAK" << "\n";
} else {
cout << "NIE" << "\n";
}
czysc(N);
return;
}
if (n == 2) {
if (abs(a[2] - a[1]) <= 1) {
cout << "TAK" << "\n";
} else {
cout << "NIE" << "\n";
}
czysc(N);
return;
}
for (int i = 1; i <= n; i ++) {
if (a[i] == 0) {
cout << "NIE" << "\n";
czysc(N);
return;
}
b[i] = 1;
b[i] += max(0, min(a[i] - a[i - 1], a[i] - a[i + 1]));
}
if (n == 3 && b[2] == 3) {
cout << "TAK" << "\n";
czysc(N);
return;
}
bool ok = true;
for (int i = 1; i <= n; i ++) {
if (b[i] > 2) {
ok = false;
break;
}
if (b[i] == 2 && i != 2 && i != n - 1) {
ok = false;
break;
}
}
if (ok) {
cout << "TAK" << "\n";
} else {
cout << "NIE" << "\n";
}
czysc(N);
}
int main () {
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int t;
cin >> t;
while (t --) {
rozw();
}
return 0;
}
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 | #include<bits/stdc++.h> using namespace std; const int MAXN = 1000 * 1000 + 17; int a[MAXN]; int a2[MAXN]; int b[MAXN]; void czysc (int n) { for (int i = 1; i <= n; i ++) { a[i] = 0; a2[i] = 0; b[i] = 0; } } void rozw () { int n; cin >> n; int N = n; for (int i = 1; i <= n; i ++) { cin >> a[i]; } int pocz = 1; while (a[pocz] == 0 && pocz <= n) { pocz ++; } int kon = n; while (a[kon] == 0 && kon >= 1) { kon --; } for (int i = pocz; i <= kon; i ++) { a2[i - pocz + 1] = a[i]; } n = kon - pocz + 1; for (int i = 1; i <= n; i ++) { a[i] = a2[i]; } if (n == 1) { if (a[1] == 1) { cout << "TAK" << "\n"; } else { cout << "NIE" << "\n"; } czysc(N); return; } if (n == 2) { if (abs(a[2] - a[1]) <= 1) { cout << "TAK" << "\n"; } else { cout << "NIE" << "\n"; } czysc(N); return; } for (int i = 1; i <= n; i ++) { if (a[i] == 0) { cout << "NIE" << "\n"; czysc(N); return; } b[i] = 1; b[i] += max(0, min(a[i] - a[i - 1], a[i] - a[i + 1])); } if (n == 3 && b[2] == 3) { cout << "TAK" << "\n"; czysc(N); return; } bool ok = true; for (int i = 1; i <= n; i ++) { if (b[i] > 2) { ok = false; break; } if (b[i] == 2 && i != 2 && i != n - 1) { ok = false; break; } } if (ok) { cout << "TAK" << "\n"; } else { cout << "NIE" << "\n"; } czysc(N); } int main () { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t; cin >> t; while (t --) { rozw(); } return 0; } |
English