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

Marcos Kawakami: Submissőes
A maior subseqüência crescente

ID DATA PROBLEMRESULT TIME MEM LING
6870894 2012-04-19 06:32:42 A maior subseqüência crescente accepted 0.17 6.9M

C++

4.3.2

6870891 2012-04-19 06:31:33 A maior subseqüência crescente accepted 0.16 6.9M

C++

4.3.2

6870880 2012-04-19 06:25:46 A maior subseqüência crescente accepted 0.18 6.9M

C++

4.3.2

6870713 2012-04-19 05:05:10 A maior subseqüência crescente accepted 0.16 6.9M

C++

4.3.2

6870337 2012-04-19 02:21:53 A maior subseqüência crescente Tempo limite excedido - 6.9M

C++

4.3.2

6870323 2012-04-19 02:17:21 A maior subseqüência crescente Resposta errada 1.29 6.9M

C++

4.3.2

code...
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.