-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy path10611-the playboy chimp_V_2.cpp
67 lines (63 loc) · 1.26 KB
/
10611-the playboy chimp_V_2.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
#include<stdio.h>
int ar[50004],n;
int search(int qn);
int main()
{
int q,qn,i,pos,k;
scanf("%d",&n);
for(i=1; i<=n; i++)
scanf("%d",&ar[i]);
scanf("%d",&q);
for(i=0; i<q; i++)
{
scanf("%d",&qn);
pos=search(qn);
if(pos>0)
{
k=pos;
while(ar[k]==qn)
--k;
if(ar[k]>0)
printf("%d ",ar[k]);
else printf("X ");
k=pos;
while(ar[k]==qn)
++k;
if(ar[k]>0)
printf("%d\n",ar[k]);
else printf("X\n");
continue;
}
if(qn>ar[n])
printf("%d X\n",ar[n]);
else if(qn<ar[1])
printf("X %d\n",ar[1]);
else
{
k=n;
while(ar[k]>qn)
--k;
printf("%d %d\n",ar[k],ar[k+1]);
}
}
return 0;
}
int search(int qn)
{
int beg=1,mid=0,pos=0,end;
end=n;
while(beg<=end)
{
mid=(beg+end)/2;
if(ar[mid]==qn)
{
pos=mid;
break;
}
else if(ar[mid]>qn)
end=mid-1;
else if(ar[mid]<qn)
beg=mid+1;
}
return pos;
}