SPOJ Brasil

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

Ricardo Hahn Pereira [POLI-USP]: Submissőes
A maior subseqüência crescente

ID DATA PROBLEMARESULTADO TEMPO MEM LING
2229609 2009-03-21 17:52:30 A maior subseqüência crescente aceito 1.31 6.8M

C++

4.0.0-8

2229606 2009-03-21 17:51:54 A maior subseqüência crescente resposta errada 1.33 6.8M

C++

4.0.0-8

2229601 2009-03-21 17:51:02 A maior subseqüência crescente resposta errada 1.40 6.8M

C++

4.0.0-8

2229581 2009-03-21 17:42:25 A maior subseqüência crescente tempo limite excedido - 6.8M

C++

4.0.0-8

code...
SPOJ System © 2012 Sphere Research Labs | Projekty informatyczne i aplikacje na zamówienie. All Rights Reserved.