SPOJ Brasil (SPOJ)

Private submission

Private submission won't be visible to other users and
won't be taken into consideration in ranks.

Disqualify submission

Your submission will be disqualified. Operation
is not reversible.

Hidden submission

Public submission

Click here to view source code.

Source code of every submission to this problem
in this contest is public.

Help

ID	DATA	PROBLEM	RESULT	TIME	MEM	LING
2471209	2009-06-09 03:41:30	A maior subseqüência crescente	accepted	0.11	6.8M	CPP
2471204	2009-06-09 03:37:06	A maior subseqüência crescente	accepted	0.12	6.9M	CPP
2467715	2009-06-08 06:05:39	A maior subseqüência crescente	accepted	1.36	6.9M	CPP
2467592	2009-06-08 04:57:56	A maior subseqüência crescente	Resposta errada	1.33	6.9M	CPP
2463623	2009-06-06 21:48:08	A maior subseqüência crescente	Tempo limite excedido	-	5.4M	CPP
2463563	2009-06-06 21:34:21	A maior subseqüência crescente	Tempo limite excedido	-	5.3M	CPP

code...

SPOJ Brasil