aparler/RosettaCodeData
1
0
Fork 0
Code Issues 12 Pull requests 3 Projects Releases Packages Wiki Activity Actions

Data update

Browse source
This commit is contained in:
Ingy döt Net 2026-02-01 16:33:20 -08:00
parent 5150844a7d
commit 4bb20c9b71
7735 changed files with 38060 additions and 199180 deletions
Download patch file Download diff file Expand all files Collapse all files

51
Task/Longest-increasing-subsequence/Ada/longest-increasing-subsequence.ada
View file

@ -1,51 +0,0 @@
with Ada.Text_IO;
procedure Longest_Increasing_Subsequence is
type Sequence is array (Positive range <>) of Integer;
Seq1 : constant Sequence :=
(3, 2, 6, 4, 5, 1);
Seq2 : constant Sequence :=
(0, 8, 4, 12, 2, 10, 6, 14, 1, 9, 5, 13, 3, 11, 7, 15);
function Lis (Seq : Sequence) return Sequence is
Best : Sequence (Seq'Range) := (others => 1);
Pred : Sequence (Seq'Range) := (others => 0);
Best_Idx, Max_Len : Natural := 0;
begin
-- Calculate LIS length for every end point
for I in Seq'Range loop
for J in 1 .. I - 1 loop
if Seq (J) < Seq (I) and then
Best (I) < 1 + Best (J) then
Best (I) := 1 + Best (J);
Pred (I) := J;
end if;
end loop;
end loop;
-- Find tail of global LIS
for I in Best'Range loop
if Best (I) > Max_Len then
Best_Idx := I;
Max_Len := Best (I);
end if;
end loop;
-- Trace sequence
declare
Lis : Sequence (1 .. Max_Len);
begin
for I in reverse 1 .. Max_Len loop
Lis (I) := Seq (Best_Idx);
Best_Idx := Pred (Best_Idx);
end loop;
return Lis;
end;
end Lis;
begin
Ada.Text_IO.Put_Line (Lis (Seq1)'Image);
Ada.Text_IO.Put_Line (Lis (Seq2)'Image);
end Longest_Increasing_Subsequence;