Service Lane || HackerRank C Programming Solution

A driver is driving on the freeway. The check engine light of his vehicle is on, and the driver wants to get service immediately. Luckily, a service lane runs parallel to the highway. It varies in width along its length.

You will be given an array of widths at points along the road (indices), then a list of the indices of entry and exit points. Considering each entry and exit point pair, calculate the maximum size vehicle that can travel that segment of the service lane safely.

Example

If the entry index,  and the exit, , there are two segment widths of  and  respectively. The widest vehicle that can fit through both is . If  and , the widths are  which limits vehicle width to .

Function Description

Complete the serviceLane function in the editor below.

serviceLane has the following parameter(s):

• int n: the size of the  array
• int cases[t][2]: each element contains the starting and ending indices for a segment to consider, inclusive

Returns

• int[t]: the maximum width vehicle that can pass through each segment of the service lane described

Input Format

The first line of input contains two integers,  and , where  denotes the number of width measurements and , the number of test cases. The next line has  space-separated integers which represent the array .

The next  lines contain two integers,  and , where  is the start index and  is the end index of the segment to check.

Constraints

Sample Input

STDIN               Function
-----               --------
8 5                 n = 8, t = 5
2 3 1 2 3 2 3 3     width = [2, 3, 1, 2, 3, 2, 3, 3]
0 3                 cases = [[0, 3], [4, 6], [6, 7], [3, 5], [0, 7]]
4 6
6 7
3 5
0 7

Sample Output

1
2
3
2
1

Explanation

Below is the representation of the lane:

   |HIGHWAY|Lane|    ->    Width

0: |       |--|            2
1: |       |---|           3
2: |       |-|             1
3: |       |--|            2
4: |       |---|           3
5: |       |--|            2
6: |       |---|           3
7: |       |---|           3

1. : From index  through  we have widths  and . Nothing wider than  can pass all segments.
2. : From index  through  we have widht  and . Nothing wider than  can pass all segments.
3. :  .
4. : 
5. : .

Solution:

#include <stdio.h>

#include <string.h>

#include <math.h>

#include <stdlib.h>

int main() 

{

    int i,n,j,t,min;

    scanf("%d%d",&n,&t);

    int* arr=(int*)malloc(n*sizeof(int));

    int p,q;

    for(i=0;i<n;i++)

    {

        scanf("%d",arr+i);

    }

    min=4;

    for(i=0;i<t;i++)

    {

        scanf("%d%d",&p,&q);

        min=4;

        for(j=p;j<=q;j++)

        {

            if(arr[j]<min)

                min=arr[j];

        }

        printf("%d\n",min);

    }

    return 0;

}