#include <bits/stdc++.h> using namespace std; #define FOR(i, a, b) for(int i = (a); i < (b); i++) #define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--) #define SZ(a) int(a.size()) #define ALL(a) a.begin(), a.end() #define PB push_back #define MP make_pair #define F first #define S second typedef long long LL; typedef vector<int> VI; typedef vector<LL> VL; typedef pair<int, int> PII; typedef pair<LL, LL> PLL; typedef double db; bool check(int n, VI a) { int l = 0, r = n - 1; while (a[l] == 0) l++; while (a[r] == 0) r--; for (; l + 1 <= r && a[l] < a[l + 1]; l++) { a[l + 1] -= a[l]; a[l] = 0; } for (; r - 1 >= l && a[r] < a[r - 1]; r--) { a[r - 1] -= a[r]; a[r] = 0; } FOR(i, l, r + 1) { if (a[i] == 0) return false; a[i]--; } FOR(i, l, r) { if (a[i] > a[i + 1]) return false; a[i + 1] -= a[i]; a[i] = 0; } return a[r] == 0; } void solve() { int n; cin >> n; VI a(n); for (int& ai : a) cin >> ai; cout << (check(n, a) ? "TAK" : "NIE") << "\n"; } int main() { ios::sync_with_stdio(0); cin.tie(0); int t; cin >> t; while (t--) solve(); 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 | #include <bits/stdc++.h> using namespace std; #define FOR(i, a, b) for(int i = (a); i < (b); i++) #define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--) #define SZ(a) int(a.size()) #define ALL(a) a.begin(), a.end() #define PB push_back #define MP make_pair #define F first #define S second typedef long long LL; typedef vector<int> VI; typedef vector<LL> VL; typedef pair<int, int> PII; typedef pair<LL, LL> PLL; typedef double db; bool check(int n, VI a) { int l = 0, r = n - 1; while (a[l] == 0) l++; while (a[r] == 0) r--; for (; l + 1 <= r && a[l] < a[l + 1]; l++) { a[l + 1] -= a[l]; a[l] = 0; } for (; r - 1 >= l && a[r] < a[r - 1]; r--) { a[r - 1] -= a[r]; a[r] = 0; } FOR(i, l, r + 1) { if (a[i] == 0) return false; a[i]--; } FOR(i, l, r) { if (a[i] > a[i + 1]) return false; a[i + 1] -= a[i]; a[i] = 0; } return a[r] == 0; } void solve() { int n; cin >> n; VI a(n); for (int& ai : a) cin >> ai; cout << (check(n, a) ? "TAK" : "NIE") << "\n"; } int main() { ios::sync_with_stdio(0); cin.tie(0); int t; cin >> t; while (t--) solve(); return 0; } |