Merge pull request #78 from arpitjain22june/patch-10

Create PainterProblem.java

Author: srsandy

Practice Problems/BinarySearch/PainterProblem/PainterProblem.java

@@ -0,0 +1,51 @@
+import java.util.Scanner;
+
+public class PainterProblem {
+//find the minimum time to paint n board with different length and 1 unit length take 1 unit time by k painter
+//	painter can only paint continous block
+//	1 painter will paint 1 block only
+	public static int pno(int[] a, int n, long mid) {
+		long s = 0;
+		int p = 1;
+		for (int i = 0; i < n; i++) {
+			s += a[i];
+			if (s > mid) {
+				s = a[i];
+				p++;
+			}
+		}
+		return p;
+	}
+
+	public static void main(String[] args) {
+		Scanner sc = new Scanner(System.in);
+		int k = -1;
+		if (sc.hasNext()) {
+			k = sc.nextInt();
+		}
+		int n = sc.nextInt();
+		int[] a = new int[n];
+		long s = 0;//sum
+		int m = 0;//max
+		for (int i = 0; i < n; i++) {
+			a[i] = sc.nextInt();
+			s += a[i];
+			m = Math.max(m, a[i]);
+		}
+
+		long l = m;//lowest time = max block length in array
+		long h = s;//maximum time  = sum of all board length
+		while (l < h) {
+			long mid = (l + h) / 2;
+			if (pno(a, n, mid) <= k) {//if it is possible to paint in this time
+				h = mid;//try to search for more lower value therefore dec h
+//				we cant do h= mid -1 as we need a answer and mid was possible
+			} else {
+				l = mid + 1;//it wasn't possible then search in upper half and inc l
+			}
+		}
+		System.out.println(l);
+
+	}
+
+}

Practice Problems/BinarySearch/PainterProblem/Readme.md

@@ -0,0 +1,23 @@
+Given K painters to paint N boards where each painter takes 1 unit of time to paint 1 unit of boards i.e. if the length of a particular board is 5, it will take 5 units of time to paint the board. Compute the minimum amount of time to paint all the boards.
+
+Note that:
+
+Every painter can paint only contiguous segments of boards.
+A board can only be painted by 1 painter at maximum.
+Input Format
+First line contains K which is the number of painters. Second line contains N which indicates the number of boards. Third line contains N space separated integers representing the length of each board.
+
+Constraints
+1 <= K <= 10
+1 <= N <= 10
+1<= Length of each Board <= 10^8
+
+Output Format
+Output the minimum time required to paint the board.
+
+Sample Input
+2
+2
+1 10
+Sample Output
+10