Cod sursa(job #563597)

Utilizator AndreiRSStatescu Andrei Rares AndreiRS Data 25 martie 2011 15:33:18
Problema Heapuri Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.02 kb
#include <stdio.h>
#define DIM 200005

int N, X, A[DIM], H[DIM], I[DIM];

void swap (int &a, int &b)
{
	int x = a;
	a = b;
	b = x;
}

void urca (int n)
{
	int t = n >> 1;
	if (t && A[H[t]] > A[H[n]])
	{
		swap (H[t], H[n]);
		I[H[t]] = t;
		I[H[n]] = n;
		urca (t);
	}
}

void coboara (int n)
{
	int f = n << 1;
	if (f > H[0]) return;
	if (A[H[f]] < A[H[n]])
	{
		if (H[f + 1] < H[f])
			f++;
		swap (H[n], H[f]);
		I[H[n]] = n;
		I[H[f]] = f;
		coboara (f);
	}
}

int main ()
{
	freopen ("heapuri.in", "r", stdin);
	freopen ("heapuri.out", "w", stdout);
	
	scanf ("%d", &N);
	for (int i = 0, t; i < N; i++)
	{
		scanf ("%d", &t);
		switch (t)
		{
			case 1:
				scanf ("%d", &A[++A[0]]);
				H[++H[0]] = A[0];
				I[A[0]] = A[0];
				
				urca (H[0]);
				break;
			case 2:
				scanf ("%d", &X);
				H[I[X]] = H[H[0]];
				I[H[H[0]--]] = I[X];
				
				urca (I[X]);
				coboara (I[X]);
				break;
			case 3:
				printf ("%d ", A[H[1]]);
				break;
		}
	}	
	return 0;
}