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

[UNICAMP] Davi Costa: Submissőes
A maior subseqüência crescente

ID DATA PROBLEMARESULTADO TEMPO MEM LING
2471209 2009-06-09 03:41:30 A maior subseqüência crescente aceito 1.17 6.8M

C++

4.0.0-8

2471204 2009-06-09 03:37:06 A maior subseqüência crescente aceito 1.22 6.9M

C++

4.0.0-8

2467715 2009-06-08 06:05:39 A maior subseqüência crescente aceito 1.36 6.9M

C++

4.0.0-8

2467592 2009-06-08 04:57:56 A maior subseqüência crescente resposta errada 1.33 6.9M

C++

4.0.0-8

2463623 2009-06-06 21:48:08 A maior subseqüência crescente tempo limite excedido - 5.4M

C++

4.0.0-8

2463563 2009-06-06 21:34:21 A maior subseqüência crescente tempo limite excedido - 5.3M

C++

4.0.0-8

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