Breaking News: Grepper is joining You.com. Read the official announcement!

Noise In The Library star_border In a library, N books are kept on a horizontal shelf in the decreasing order of their IDs. Now assume that, in order to reach a book present at i th index(consider 0-based indexing), it takes i steps from leftmost position

HARSH SHARMA answered on March 31, 2023 Popularity 3/10 Helpfulness 1/10

answer Noise In The Library star_border In a library, N books are kept on a horizontal shelf in the decreasing order of their IDs. Now assume that, in order to reach a book present at i th index(consider 0-based indexing), it takes i steps from leftmost position

Noise In The Library star_border In a library, N books are kept on a horizontal shelf in the decreasing order of their IDs. Now assume that, in order to reach a book present at i th index(consider 0-based indexing), it takes i steps from leftmost position

Comment

public class Main {
    /*
    	function to check if it is possible to allocate the books such that the 
    	maximum number of pages assigned to any student is numPages
    */
    static boolean isPossible(int arr[], int n, int m, int curr_min) {
        int cntStudents = 1;
        int curSum = 0;
         // iterate over all the books
        for (int i = 0; i < n; i++) {
             if (arr[i] > curr_min)
                return false;
             if (curSum + arr[i] > curr_min) {
             
                 //Increment student count by '1'
                cntStudents++;
                
                //assign current book to next student and update curSum.
                curSum = arr[i];
                
                //If count of students becomes greater than given no. of students, return False.
                if (cntStudents > m)
                    return false;
            }
            //Else assign this book to current student and update curSum.
            else
                curSum += arr[i];
        }
        return true;
    }

    // method to find minimum number of pages
    static int findPages(int arr[], int n, int m) {
        long sum = 0;
        //If number student is more than number of books.
        if (n < m)
            return -1;
            
        //Count total number of pages.
        for (int i = 0; i < n; i++)
            sum += arr[i];
            
        for (int numPages = 1; numPages <= sum; numPages++) {
            if (isPossible(arr, n, m, numPages)) {
                return numPages;
            }
        }
        return -1;
    }
 
    public static void main(String[] args) {
        int arr[] = {10, 20, 30, 40};
        int m = 2; //No. of students
        int n = 4;
        System.out.println("The minimum value of the maximum number of pages in book allocation is: " + findPages(arr, n, m));
    }
}

Popularity 3/10 Helpfulness 1/10 Language whatever

Source: www.codingninjas.com

Tags: n noise position whatever

Link to this answer
Share Copy Link

Contributed on Mar 31 2023

HARSH SHARMA

0 Answers Avg Quality 2/10

Noise In The Library star_border In a library, N books are kept on a horizontal shelf in the decreasing order of their IDs. Now assume that, in order to reach a book present at i th index(consider 0-based indexing), it takes i steps from leftmost position

Contents

More Related Answers

Noise In The Library star_border In a library, N books are kept on a horizontal shelf in the decreasing order of their IDs. Now assume that, in order to reach a book present at i th index(consider 0-based indexing), it takes i steps from leftmost position

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.