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
6155104	2011-12-09 16:24:29	A maior subseqüência crescente	accepted	0.18	5.4M	C++ 4.3.2
6155082	2011-12-09 16:19:16	A maior subseqüência crescente	accepted	0.18	5.4M	C++ 4.3.2
3663461	2010-05-25 23:47:01	A maior subseqüência crescente	accepted	0.20	5.4M	C++ 4.3.2
3663453	2010-05-25 23:36:24	A maior subseqüência crescente	Tempo limite excedido	-	5.4M	C++ 4.3.2
3663432	2010-05-25 23:24:18	A maior subseqüência crescente	Tempo limite excedido	-	5.4M	C++ 4.3.2
3663426	2010-05-25 23:21:32	A maior subseqüência crescente	Tempo limite excedido	-	5.4M	C++ 4.3.2

code...

SPOJ Brasil