Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- using System;
- namespace ConsoleApp1
- {
- class Program
- {
- static void Main(string[] args)
- {
- for(int i=0; i<n; i++)
- {
- C[i][0] = 0;
- }
- for(int j= 0; j<m; j++)
- {
- C[0][j] = 0;
- }
- for(int i = 1;i < n; i++)
- {
- for(int j=1; j<m;j++)
- {
- if(A[i] == B[j])
- {
- C[i][j] = C[i - 1][j - 1] + 1
- }
- }
- else
- {
- C[i][j] = max(C[i - 1][j], C[i][j - 1]);
- }
- }
- for j := 1 to m do
- if A[i] = B[j] then
- C[i][j] := C[i - 1][j - 1] + 1 // znaleziono kolejny element NWP
- else
- C[i][j] = max(C[i - 1][j], C[i][j - 1]);
- }
- //pushBST
- //przywracanie_wlasnosci_kopca_gora
- //przywracanie_wlasnosci_kopca_dol
- //PopKopiec
- //liczby: 8,3,1,5,4,6,9,12,10
- // 8
- // 3 9
- // 1 5 12
- // || |4 6||10 |
- // kolejka z priorytetem to kopiec
- // w in-order: 1,3,4,5,6,8,9,10,12
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement