Uvod u dinamicko programiranje

Algoritam G: Pseudo kod problema NRP
Input: Niz a dužine n
Output: LIS - najduži rastući podniz niz a
1 for k ← 1 to n do
2 max = 0;
3 for i ← 1 to k − 1 do
4 if a[k] > a[i] and d[i] > max then
5
max = d[j];
6 end
7 end
8 d[k] = max + 1;
9 end
10 max = 0;
11 index = 0;
12 for k ← 1 to n do
13 if d[k] > max then
14 max = d[k];
15 index = k;
16 end
17 end
18 LIS ← ∅;
19 while d[index] > 1 do
20 add a[index] to LIS;
21 i = index − 1;
22 while d[index] > d[i] + 1 do
23 i = i − 1;
24 end
25 index = i;
26 end
27 add a[index] to LIS;
28
return LIS;
10