-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path1010.cpp
45 lines (45 loc) · 1012 Bytes
/
1010.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
#include <iostream>
using namespace std;
void midsearch(int left, int right, int target, int father, int* data);
// ×¢Òâ×ÓÎÊÌâµÄ»®·Ö¡£
int main()
{
int m;
cin >> m;
for (int i = 0;i < m;i++)
{
int n, x;
cin >> n >> x;
int data[20010];
for (int j = 0;j < n;j++)
{
cin >> data[j];
}
midsearch(0, n - 1, x, data[(n - 1) / 2], data);
}
}
void midsearch(int left, int right, int target, int father, int* data)
{
if (left <= right)
{
int mid = (left + right) / 2;
if (data[mid] == target)
{
cout << "success, father is " << father << endl;
return;
}
else if (data[mid] > target)
{
midsearch(left, mid - 1, target, data[mid], data);
}
else
{
midsearch(mid + 1, right, target, data[mid], data);
}
}
else
{
cout << "not found, father is " << father << endl;
}
return;
}