Cod sursa(job #2137325)
Utilizator | Data | 20 februarie 2018 18:50:01 | |
---|---|---|---|
Problema | Cautare binara | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 1.29 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
long long int a[100005],n,m,i,j,x,c;
int a0[100005],a2[100005];
int main()
{
fin>>n;
for(i=1;i<=100000;i++)
{
a0[i]=-1;
a2[i]=-1;
}
for(i=1;i<=n;i++)
{
fin>>a[i];
}
for(i=n;i>=1;i--)
{
x=a[i];
if(a0[x]==-1)
{
a0[x]=i;
}
}
for(i=1;i<=n;i++)
{
x=a[i];
if(a0[x]==-1)
{
a0[x]=i;
}
}
fin>>m;
for(i=1;i<=m;i++)
{
fin>>c>>x;
if(c==0)
{
if(a0[x]!=-1)
fout<<a0[x]<<endl;
else if(a0[x]==-1)
fout<<-1<<endl;
}
else if(c==1)
{
for(j=n;j>=1;j--)
{
if(a[j]<=x)
{
fout<<j<<endl;
break;
}
}
}
else
{
for(j=1;j<=n;j++)
{
if(a[j]>=x)
{
fout<<j<<endl;
break;
}
}
}
}
return 0;
}