Pagini recente » Monitorul de evaluare | Cod sursa (job #2076871) | Clasament dupa rating | Profil Oveeh | Cod sursa (job #798940)
Cod sursa(job #798940)
#include <fstream>
using namespace std;
const int maxn=1000000;
int st[maxn],dr[maxn], nr[maxn], val[maxn], v, max, nrnod;
ifstream f1("elmaj.in");
ofstream f2("elmaj.out");
void adauga(x)
void cauta(int nod, int x) {
if (x==val[nod]) nr[nod]++; else
if (x<val[nod]) {
if (st[nod]) adauga(st[nod],x);
else { nrnod++; st[nod]=nrnod; val[st[nod]]=x; nr } }
int main() {
f1>>n;
for (i=1; i<=n; i++)
{ f1>>v;
cauta(1,v); }
return 0;}