I want to solve the following problem

[srisrinu]

There are N people on a street (numbered 1 through N). For simplicity, we'll view them as points on a line. For each valid i, the position of the i-th person is Xi.

It turns out that exactly one of these people is infected with the virus COVID-19, but we do not know which one. The virus will spread from an infected person to a non-infected person whenever the distance between them is at most 2. If we wait long enough, a specific set of people (depending on the person that was infected initially) will become infected; let's call the size of this set the final number of infected people.

Your task is to find the smallest and largest value of the final number of infected people, i.e. this number in the best and in the worst possible scenario.

Input
The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows.
The first line of each test case contains a single integer N.
The second line contains N space-seperated integers X1,X2,…,XN.
Output
For each test case, print a single line containing two space-separated integers ― the minimum and maximum possible final number of infected people.

Constraints
1≤T≤2,000
2≤N≤8
0≤Xi≤10 for each valid i
X1<X2<…<XN
Subtasks
Subtask #1 (10 points): N≤3
Subtask #2 (90 points): original constraints

Example Input
3
2
3 6
3
1 3 5
5
1 2 5 6 7
Example Output
1 1
3 3
2 3
Explanation:
Example case 1: The distance between the two people is 3, so the virus cannot spread and at the end, there will always be only one infected person.

Example case 2: The distance between each two adjacent people is 2, so all of them will eventually get infected.

Example case 3:

In one of the best possible scenarios, the person at the position 1 is infected initially and the virus will also infect the person at the position 2.
In one of the worst possible scenarios, the person at the position 5 is infected initially and the virus will also infect the people at the positions 6 and 7.

for _ in range(int(input())):
    n=int(input())
    arr=list(map(int,input().split()))
    (m,c)=(1,1)
    for i in range(1,len(arr)):
        if(arr[i]-arr[i-1]<=2):
            c+=1
    m=c        
    print(m,c)    
        
        

this is the code i've written can anybody help in solving this problem

[deanhystad]

Get the input first, then process. I would write a separate function for getting the input and processing the test cases. This makes it easy to dummy in data while testing the processing.

def input_testcases():
    """Input testcase data
    Input
    The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows.
    The first line of each test case contains a single integer N.
    The second line contains N space-seperated integers X1,X2,…,XN.
    """
    return [[3, 6], [1, 3, 5], [1, 2, 5, 6, 7]]  # For initial testing
    test_cases = []
    for _ in range(int(input())):
        n=int(input())
        test_cases.append(list(map(int,input().split())))
    return test_cases

def infection_range(test_case, min_space):
    """Assuming one random individual is infected, determine the
    minimum and maximum number of people to be infected given
    the spacing information in the test case and the infection
    envelope minspace.
    """
    return [1, 1] # Replace with real code

test_cases = input_testcases()
print(test_cases) # Only use when verifying input_testcases
for test_case in test_cases:
    print(*infection_range(test_case, 2))

The processing for each test case is to find the minimum infection group and the maximum infection group. I would start by finding the size of each infection group.
What is the logic for finding the size of an infection group?

[Larz60+]

deanhystad -- This is a homework assignment.
please read following forum rule: https://python-forum.io/misc.php?action=help&hid=52

[deanhystad]

I added that the program should be broken into two functions. That is all. Initial post already provided the code that reads in the input (input_testcases). Docstrings are copied from original post. No code was provided that shows how to find the infection numbers or how to return the minimum and maximum numbers.

[Larz60+]

Ok