Pagini recente » Cod sursa (job #2666131) | Cod sursa (job #64275) | Cod sursa (job #1163190) | Cod sursa (job #308561) | Cod sursa (job #2376860)
#include <iostream>
#include <fstream>
using namespace std;
int n,i,v[1000001],j,ok,m,p,s,d,t,w[1000001];
long long int x;
int main()
{ifstream f("cautbin.in");
ofstream g("cautbin.out");
f>>n;
for(i=1;i<=n;i++) {f>>x;
if(v[x]==0)v[x]=i;else w[x]=i;}
f>>m;
for(i=1;i<=m;i++){
f>>p>>x;
if(p==0){
if(v[x]!=0) {if(w[x]!=0) g<<w[x]<<endl;
else g<<v[x];
}else g<<-1<<endl;
}if(p==1){if(v[x]!=0){
if(w[x]!=0) g<<w[x]<<endl;
else g<<v[x]<<endl;
}else {
while(v[x]==0) x--;
if(w[x]==0)g<<v[x]<<endl;else g<<w[x]<<endl;
}
}if(p==2){
if(v[x]!=0) g<<v[x];
else {while(v[x]==0) x++;
g<<v[x]<<endl;
}}
}
}