fork download
copy 
  1. #include <stdio.h>
  2. int i,n,ar[500005]={},Q,a;
  3. int f(int low,int high)
  4. {
  5. 	if(low>high) return -1;
  6. 	int mid=(low+high)/2;
  7. 	if(ar[mid]==a) return mid;
  8. 	if(ar[mid]>a) return f(low,mid-1);
  9. 	return f(mid+1,high);
  10. }
  11. int main()
  12. {
  13. 	scanf("%d",&n);
  14. 	for(i=0;i<n;i++)
  15. 	{
  16. 		scanf("%d",&ar[i]);
  17. 	}
  18. 	scanf("%d",&Q);
  19. 	for(i=0;i<Q;i++)
  20. 	{
  21. 		scanf("%d",&a);
  22. 		printf("%d ",f(0,n));
  23. 	}
  24.  
  25. 	return 0;
  26. }
Success #stdin #stdout 0.01s 5316KB
comments (?)
stdin
copy 
5
1 2 3 4 5
3
-5 5 2
stdout
copy 
-1 4 1
https://ideone.com/sHDide
3517 Tutorial : 이진탐색(Binary Search-이진검색)
language:
C++ (gcc 8.3)
created:
1 year ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!