-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathA_Was_there_an_Array.cpp
More file actions
76 lines (71 loc) · 1.22 KB
/
A_Was_there_an_Array.cpp
File metadata and controls
76 lines (71 loc) · 1.22 KB
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
/*maruf_bro*/
#include <bits/stdc++.h>
using namespace std;
#define IO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define ld long double
#define ll long long
#define vec vector<ll>
#define pb push_back
#define fcin(n) \
for (auto &x : n) \
cin >> x
#define fcout(n) \
for (auto x : n) \
cout << x << " "
#define YES puts("YES")
#define NO puts("NO")
#define endl '\n'
/*
"The harder the problem, the sweeter the victory. Keep coding!"
*/
int Case = 1;
void solve()
{
int n;
cin >> n;
vector<int> arr(n - 2);
for (int i = 0; i < n - 2; i++)
{
cin >> arr[i];
}
if (n < 5)
{
YES;
return;
}
else
{
bool flag = true;
for (int i = 0; i < n - 4; i++)
{
if (arr[i] == 1 && arr[i + 1] == 0 && arr[i + 2] == 1)
{
flag = false;
}
}
if (flag)
{
YES;
return;
}
else
{
NO;
return;
}
}
}
signed main()
{
IO;
int t;
cin >> t;
while (t--)
{
solve();
}
return 0;
}