Pagini recente » Cod sursa (job #1927165) | Cod sursa (job #2043638) | Cod sursa (job #1000982) | Cod sursa (job #1933618) | Cod sursa (job #2175185)
#include <fstream>
using namespace std;
ifstream f("schi.in");
ofstream g("schi.out");
unsigned int n,mij,i,poz,Max,a[100005],j[100005],c[100005],dr,st,k,x,q;
int main()
{ f>>n;
Max=0;
for(i=1;i<=n;i++)
{
f>>a[i];
if(a[i]>Max)
{
Max=a[i];
k++;
c[k]=a[i];
j[k]=0;
}
if(a[i]<=Max)
{
j[k]++;
}
}
f>>x;
for(i=1;i<=x;i++)
{
f>>q;
st=1;
dr=k;
poz=0;
while(poz==0 && st<=dr)
{
mij=(st+dr)/2;
if(c[mij]==q)
{
poz=mij;
}
else if(c[mij]>q) dr=mij-1;
else st=mij+1;
}
g<<j[poz]<<" ";
}
return 0;
}