Cod sursa(job #484222)

Utilizator Athena99Anghel Anca Athena99 Data 12 septembrie 2010 21:46:24
Problema Cautare binara Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.06 kb
#include <stdio.h>

int i,n,x,v[100000],r,l=1,a,b,y,t[100000],z[100000],j;

int cb1(x)
{
	int m=l+(l+r)/2;
	while (v[m]!=x && l<r)
		  {
		   if (v[m]<x) l=m+1;
		   else r=m-1;
		   m=l+(l+r)/2;
		  }
	if (v[m]==x) return m;
	else return -1;
}

int cb2(x)
{
	int m=l+(l+r)/2;
	while (v[m]!=x && l<r)
		  {
		   if (v[m]<x) l=m+1;
		   else r=m-1;
		   m=l+(l+r)/2;
		  }
	return m;
}

int main()
{
	freopen("cautbin.in","r",stdin);
	freopen("cautbin.out","w",stdout);
	scanf("%d",&n);
	r=n;
	for (i=1; i<=n; ++i) scanf("%d",&v[i]);
	scanf("%d",&y);
	for (i=1; i<=y; ++i) scanf("%d%d",&t[i],&z[i]);
	for (i=1; i<=y; ++i)
		if (t[i]==0)
		   {
			x=z[i];
			printf("%d\n",cb1(x));
		   }
		   else if (t[i]==1)
				   {
					x=z[i];
					printf("%d\n",cb2(x));
				   }
				   else
					   {
						x=z[i];
						a=cb1(x);
						b=cb2(x);
						if (b!=a) printf ("%d",b);
						   else for (j=1; j<=n; ++j)
									if (v[j]==x)
									   {
										printf("%d",j);
										break;
									   }
					   }
	return 0;
}