Pagini recente » Cod sursa (job #1473454) | Cod sursa (job #2419191) | Cod sursa (job #2575069) | Cod sursa (job #340584) | Cod sursa (job #847681)
Cod sursa(job #847681)
#include <fstream>
using namespace std;
int a[100005];
int main()
{
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int m, n, i, x, y, st, dr, afis=-1;
f >> m;
for(i=1; i<=m; i++)
f >> a[i];
f >> n;
for (i=1; i<=n; i++)
{f >> x >> y;
if(x==0)
{st=1; dr=m; afis=-1;
while(st<=dr)
{
if (a[st+(dr-st)/2]>y) dr=st+(dr-st)/2-1;
if (a[st+(dr-st)/2]<y) st=st+(dr-st)/2+1;
if (a[st+(dr-st)/2]==y) {afis=st+(dr-st)/2; st=st+(dr-st)/2+1;}
}
g << afis << endl;
}
if(x==1)
{st=1; dr=m;
while(st<=dr)
{
if (a[st+(dr-st)/2]>y) dr=st+(dr-st)/2-1;
if (a[st+(dr-st)/2]<=y) {afis=st+(dr-st)/2; st=st+(dr-st)/2+1;}
}
g << afis << endl;
}
if(x==2)
{st=1; dr=m;
while(st<=dr)
{
if (a[st+(dr-st)/2]<y) st=st+(dr-st)/2+1;
if (a[st+(dr-st)/2]>=y) {afis=st+(dr-st)/2; dr=st+(dr-st)/2-1;}
}
g << afis << endl;
}
}
return 0;
}