Pagini recente » Cod sursa (job #1740386) | Cod sursa (job #879709) | Cod sursa (job #985381) | Cod sursa (job #2166963) | Cod sursa (job #348993)
Cod sursa(job #348993)
#include<fstream.h>
ifstream fin("cautbin.in");
ofstream fout("cautbin.out");
int n,m;
long a[100100];
void citire()
{long i;
fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];
fin>>m;
}
int tip_0(long x)
{long st,dr,mij,i;
st=1;dr=n;
while(st<=dr)
{mij=st+(dr-st)/2;
if(a[mij]==x) {for(i=mij+1;a[i]==x;i++);
return i-1;
}
else if(a[mij]>x) dr=mij;
else st=mij;
}
return -1;
}
int tip_1(long x)
{long st,dr,mij,i;
st=1;dr=n;
while(st<=dr)
{mij=st+(dr-st)/2;
if(a[mij]==x) {for(i=mij+1;a[i]==x;i++);
return i-1;
}
else if(a[mij]>x) dr=mij;
else if(a[mij+1]>x) return mij;
else st=mij;
}
}
int tip_2(long x)
{long st,dr,mij,i;
st=1;dr=n;
while(st<=dr)
{mij=st+(dr-st)/2;
if(a[mij]==x) {for(i=mij-1;a[i]==x;i--);
return i+1;
}
else if(a[mij]>x) if(a[mij-1]<x) return mij;
else dr=mij;
else st=mij;
}
}
void rezolvare()
{long i;
short tip;
long x;
for(i=1;i<=m;i++)
{fin>>tip>>x;
if(tip==0) fout<<tip_0(x)<<'\n';
else if(tip==1) fout<<tip_1(x)<<'\n';
else fout<<tip_2(x)<<'\n';
}
}
int main()
{citire();
rezolvare();
fin.close();
fout.close();
return 0;
}