Pagini recente » Cod sursa (job #1984276) | Cod sursa (job #2622304) | Cod sursa (job #414795) | Cod sursa (job #3278673) | Cod sursa (job #3151910)
#include <iostream>
using namespace std;
int n,v[100001];
int f0(int x){
int i=n;
while(i>=1 && x!=v[i])
i--;
return i;
}
int f1(int x){
int i=1;
while(i<=n && v[i]<=x)
i++;
return i-1;
}
int f2(int x){
int i=1;
while(i<=n && v[i]<x)
i++;
return i;
}
int main()
{
int i,m,q,x;
cin>>n;
for(i=1; i<=n; i++)
cin>>v[i];
cin>>m;
for(i=1; i<=m; i++){
cin>>q>>x;
if(q==0)
cout<<f0(x)<<"\n";
if(q==1)
cout<<f1(x)<<"\n";
if(q==2)
cout<<f2(x)<<"\n";
}
return 0;
}