Cod sursa(job #2665676)
| Utilizator | Data | 31 octombrie 2020 10:56:34 | |
|---|---|---|---|
| Problema | Cautare binara | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <fstream>
using namespace std;
ifstream cin("cautbin.in");
ofstream cout("cautbin.out");
int n,v[101],m,i,nrI,x,maxi,mini,j;
int main()
{cin>>n;
for(i=1;i<=n;i++)
cin>>v[i];
cin>>m;
for(i=1;i<=m;i++)
{cin>>nrI>>x;
for(j=1;j<=n;j++)
{if(nrI==0)
{if(v[j]==x&&j>maxi)
maxi=j;
}
else if(nrI==1)
{if(v[j]<=x&&j>maxi)
maxi=j;
}
else
{if(v[j]>=x&&j<mini)
mini=j;
}
}
if(nrI==2)
cout<<mini<<endl;
else
cout<<maxi<<endl;
maxi=0;
mini=99999999;
}
return 0;
}
