Pagini recente » Cod sursa (job #1207253) | Cod sursa (job #434830) | Cod sursa (job #2238237) | Cod sursa (job #738486) | Cod sursa (job #1991028)
#include <iostream>
#include<fstream>
using namespace std;
int a[100000], n, m,x,y;
int caut0(int x)
{
int r=0, pas=1<<16;
while(pas!=0)
{
if(r+pas<=n && a[r+pas]<=x)
{
r+=pas;
}
pas/=2;
}
if(a[r]!=x)
{
return -1;
}
else return r;
}
int caut1(int x)
{
int r=0, pas=1<<16;
while(pas!=0)
{
if(r+pas<=n && a[r+pas]<=x)
{
r+=pas;
}
pas/=2;
}
return r;
}
int caut2(int x)
{
int r=0, pas=1<<16;
while(pas!=0)
{
if(r+pas<=n && a[r+pas]<x)
{
r+=pas;
}
pas/=2;
}
return r+1;
}
int main()
{
ifstream cin ("cautbin.in");
ofstream cout ("cautbin.out");
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a[i];
}
cin>>m;
for(int i=1;i<=m;i++)
{
cin>>x>>y;
if(x==0)
{
cout<<caut0(y)<<endl;
}
else if(x==1)
{
cout<<caut1(y)<<endl;
}
else cout<<caut2(y)<<endl;
}
return 0;
}