-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathfindMaxInterval.cpp
69 lines (65 loc) · 1.43 KB
/
findMaxInterval.cpp
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
#include<iostream>
#include<vector>
using namespace std;
int findMax(vector<int> start,vector<int> end, int max)
{
if(start.size()<=max)
return max;
vector<int> lefts;
vector<int> lefte;
vector<int> rights;
vector<int> righte;
int largest=0;
for(int i=0;i<start.size();i++)
{
if(end[i]>largest)
largest=end[i];
}
int mid=(start[0]+largest)/2;
int count=0;
for(int i=0;i<start.size();i++)
{
cout<<start[i]<<" "<<end[i]<<endl;
if(start[i]>mid)
{
rights.push_back(start[i]);
righte.push_back(end[i]);
}
else if(end[i]<mid)
{
lefts.push_back(start[i]);
lefte.push_back(end[i]);
}
else
{
count++;
if(start[i]<mid)
{
lefts.push_back(start[i]);
lefte.push_back(mid-1);
}
if(end[i]>mid)
{
rights.push_back(mid+1);
righte.push_back(end[i]);
}
}
if(count>max)
max=count;
}
count=findMax(lefts,lefte,max);
if(count>max)
max=count;
count=findMax(rights,righte,max);
if(count>max)
max=count;
return max;
}
main()
{
int a[]={-111,3,4,5,6,7,9};
int b[]={9 , 14,6,5,8,9,10};
vector<int> A(a,a+7);
vector<int> B(b,b+7);
cout<<findMax(A,B,0)<<endl;
}