-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathArray_Book_Allocation.cpp
More file actions
93 lines (64 loc) · 1019 Bytes
/
Array_Book_Allocation.cpp
File metadata and controls
93 lines (64 loc) · 1019 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
#include<iostream>
using namespace std;
int ispossible(int arr[],int size,int m , int mid)
{
int stud=1;
int pagesum=0;
for (int i = 0; i < size; i++)
{
if (pagesum+arr[i]<=mid)
{
pagesum=pagesum+arr[i];
}
else
{
stud=stud+1;
if (stud>m || arr[i]>mid )
{
return 0;
}
pagesum=arr[i];
}
}
return 1;
}
int possiblesol(int arr[],int size,int m)
{
int start=0;
int sum=0;
int ans=0;
for (int i = 0; i < size; i++)
{
sum=sum+arr[i];
}
int end=sum;
int mid=start+(end-start)/2;
while(start<=end)
{
if (ispossible(arr,size,m,mid)==1)
{
ans=mid;
end=mid-1;
}
else
{
start=mid+1;
}
mid=start+(end-start)/2;
}
cout<< ans;
}
int main()
{
int s;
cout<<"enter size"<<endl;
cin>>s;
int demo_array[s];
cout<<"enter elements"<<endl;
for (int i = 0; i < s; i++)
{
cin>>demo_array[i];
}
possiblesol(demo_array,s,2);
return 0;
}