Pascal classic algorithm explanation - longest increasing subsequence

From , 5 Years ago, written in Delphi (Object Pascal), viewed 198 times.

    S[1]:=1;                   {以第一个元素为末元素的递增序列长度肯定是1}
    For i←2 to n do
      For j←1 to i-1 do
        Begin
          搜索A[i]前面比A[i]小的数A[j]，得到对应的S[j];
          S[i]←max{S[j]}+1;
        End;
    Write(max{S[i]});
 
 
//delphi/7196

Reply to "Pascal classic algorithm explanation - longest increasing subsequence"

Here you can reply to the paste above

Author What's your name?

Title Give your paste a title.

Language What language is your paste written in?

Your paste Paste your paste here

Create Shorturl Create a shorter url that redirects to your paste?

Private Private paste aren't shown in recent listings.

Delete After When should we delete your paste?

Spam protection Type in the letters

https://burned.cc - Burn After Reading Website

Pastebin.vip

Pascal classic algorithm explanation - longest increasing subsequence

Reply to "Pascal classic algorithm explanation - longest increasing subsequence"