Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- class Podciag
- {
- public static string najdluzszyPodciag(string str1, string str2)
- {
- int[,] tab = new int[str1.Length + 1, str2.Length + 1];
- int wynik = 0;
- int poz = 0;
- for(int i = 0; i <= str1.Length; i++)
- {
- for(int j = 0; j <= str2.Length;j++)
- {
- if (i == 0 || j == 0)
- {
- tab[i, j] = 0;
- }
- else if (str1[i - 1] == str2[j - 1])
- {
- tab[i, j] = tab[i - 1, j - 1] + 1;
- if (tab[i, j] > wynik)
- {
- wynik = tab[i, j];
- poz = i;
- }
- }
- else
- {
- tab[i, j] = 0;
- }
- }
- }
- string w = "";
- for (int i = wynik; i > 0; i--)
- w += str1[poz - i];
- return w;
- }
- public static int maxSum(int [] tab)
- {
- int max = 0;
- int j = 0;
- int sum = 0;
- for (int i = 0; i < tab.Length; i++)
- {
- if (sum < 0)
- {
- j = i;
- sum = 0;
- }
- sum += tab[i];
- if (sum > max)
- max = sum;
- }
- return max;
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement