Competitive-Programming/2049A.cpp at main · rahul810050/Competitive-Programming · GitHub

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
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t;
    cin >> t;

    while (t--) {
        int n;
        cin >> n;

        vector<int> arr(n);
        for (int i = 0; i < n; i++) {
            cin >> arr[i];
        }

        int segmentCount = 0;
        bool foundNonZero = false;

        for (int i = 0; i < n; i++) {
            if (arr[i] != 0 && !foundNonZero) {
                segmentCount++;
                foundNonZero = true;
            } else if (arr[i] == 0) {
                foundNonZero = false;
            }
        }

        cout << min(segmentCount, 2) << endl;
    }

    return 0;
}