Cod sursa(job #3120575)
| Utilizator | Data | 7 aprilie 2023 16:19:27 | |
|---|---|---|---|
| Problema | Jocul Flip | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.74 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in ("dominew.in");
ofstream out ("dominew.out");
int v[1000001],b[8001];
int main()
{
int n,m,st=0,dr=0,mij=0,poz=0;
in >> n;
for (int i=1; i<=n; i++){
in >> v[i];
}
in >> m;
for(int i=1; i<=m; i++) {
in >> b[i];
st=1;
dr=n;
poz=0;
while (st<=dr) {
mij=(st+dr)/2;
if(v[mij]<b[i]) {
poz=mij;
st=mij+1;
} else {
dr=mij-1;
}
}
for (int t=1; t<i; t++){
if(b[i]>b[t]){
poz++;
}
}
out << poz+1 << " ";
}
return 0;
}
