Cod sursa(job #432415)
| Utilizator | Data | 2 aprilie 2010 12:41:36 | |
|---|---|---|---|
| Problema | Cautare binara | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 1.58 kb |
#include<iostream.h>
#include<fstream.h>
int n,m;
int v[100000],i,a[100000];
main()
{
ifstream f("cautbin.in");
ofstream g("cautbin.out");
f>>n;
for(i = 1; i <= n; i++)
f>>v[i];
f>>m;
for(int j = 1; j <= m; j++)
{ char b[100000];
f>>b[j];
f>>a[j];
}
for(i = n; i >= 1; i--)
{ for(int j = 1;j <= m;j = j + 3)
{
int p = 0;
if(v[i] == a[j])
{
p = 1;
a[j] = i;
break;
}
if(p == 0) a[j] = -1;
}
for(int j = 2;j <= m;j = j + 3)
{
int p = 0;
if(v[i] <= a[j])
{
p = 1;
a[j] = i;
break;
}
if(p == 0) a[j] = -1;
}
}
for(i = 1; i <= n; i++)
for(int j = 3;j <= m;j = j + 3)
{
int p = 0;
if(v[i] >= a[j])
{
p = 1;
a[j] = i;
break;
}
if(p == 0) a[j] = -1;
}
for (i = 1; i <= m; i++)
g<<a[i]<<endl;
f.close();
g.close();
return 0;
}
