Cod sursa(job #1424841)
Utilizator | Data | 25 aprilie 2015 16:09:34 | |
---|---|---|---|
Problema | Factorial | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 1.57 kb |
#include<fstream>
using namespace std;
int v[100010];
int main ()
{
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int n,m,i,ask,val,st,dr,mij;
fin>>n;
for(i=1;i<=n;i++)
{
fin>>v[i];
}
fin>>m;
for(i=1;i<=m;i++)
{
fin>>ask>>val;
if(ask==0)
{
st=1;
dr=n;
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]<=val)
{
st=mij+1;
}
else
{
dr=mij-1;
}
}
if(v[dr]==val)
{
fout<<dr<<"\n";
}
else
{
fout<<"-1"<<"\n";
}
}
if(ask==1)
{
st=1;
dr=n;
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]<=val)
{
st=mij+1;
}
else
{
dr=mij-1;
}
}
fout<<dr<<"\n";
}
if(ask==2)
{
st=1;
dr=n;
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]<val)
{
st=mij+1;
}
else
{
dr=mij-1;
}
}
fout<<st<<"\n";
}
}
fin.close();
fout.close();
return 0;
}