BOMBTHEBASE | Editorial by BadisaNaveen5655

Problem Link: https://www.codechef.com/PRACTICE/problems/BOMBTHEBASE

Problem Code: BOMBTHEBASE

In the given question we need to find the maximum number of houses that can get destroyed.

Constraints
1≤T≤100
1≤N≤105
1≤X≤109
1≤Ai≤109

Input Format
The first line will contain T - the number of test cases. Then the test cases follow.
First line of each test case contains 2 integers N,X.
Second line of test case contains N space separated integers A1,A2,…,AN.

**Test case1:**
n=8 x=6
array[]=4 1 6 1 6 5 6 8
In this example array[5] < 6, then ans = (5 +1) = 6.
**Simple Approach:**
For this we can simply iterate over the array and find the largest index which satisfies the given condition.
step1: compare the x with array elements form the last index
step2: if array element < x then your ans = index + 1 and break the loop
step3: if array element >=x then ans= 0

I wrote the code in python :
```
T = int(input())
for i in range(T):
    n,x=map(int,input().split())
    a=[int(i) for i in input().split()]
    ans=0;
    for i in reversed(range(n)):
        if a[i]<x:
            ans = i +  1 
            break
        else:
            ans = 0 
    print(ans)
    ```
Note:

I consider the zero based indexing
Time complexity = O(n^2)

BOMBTHEBASE | Editorial by BadisaNaveen5655

Download submission

All caught up!

View submission

Is your resume even shortlisted?