Pagini recente » Cod sursa (job #2476785) | Monitorul de evaluare | Cod sursa (job #1262998) | Cod sursa (job #1098873) | Cod sursa (job #1264078)
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int main()
{
int n,v[10000],i,j,m,p,pp,a,b;
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
f>>m;
for(i=1;i<=m;i++){
f>>a>>b;
p=0;
if(a==0) for(j=1;j<=n;j++){
if(v[j]==b) p=j;
if(v[j]>b) break;}
if(a==1) for(j=1;j<=n;j++){
if(v[j]<=b) p=j;
if(v[j]>b) break;}
if(a==2) {pp=0;
for(j=1;j<=n;j++)
if(v[j]>=b) {p=j;break;}
}
if(p!=0) g<<p<<endl;
else g<<-1<<endl;
}
return 0;
}