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
2160203	2009-02-24 02:08:58	A maior subseqüência crescente	accepted	0.40	6.6M	CPP
2160189	2009-02-24 02:03:31	A maior subseqüência crescente	accepted	0.37	6.6M	CPP
2153430	2009-02-21 19:40:53	A maior subseqüência crescente	accepted	0.04	12M	CPP
2153154	2009-02-21 18:33:38	A maior subseqüência crescente	accepted	0.64	6.8M	CPP
2153118	2009-02-21 18:23:59	A maior subseqüência crescente	accepted	0.69	6.8M	CPP
2153104	2009-02-21 18:19:29	A maior subseqüência crescente	accepted	0.05	6.8M	CPP
2146311	2009-02-19 21:27:24	A maior subseqüência crescente	Resposta errada	0.69	6.8M	CPP
1941646	2008-12-05 19:42:10	A maior subseqüência crescente	Tempo limite excedido	-	2.9M	C

code...

SPOJ Brasil