//zadacha 4, дадено е универсално множество и негово подмножество. Да се напише функция, която намира
//колко е най-дългата последователност в подмножеството
int FindTheLargestSequence(int*numbers1, int* numbers2, int numbers1Sz, int numbers2Sz);

int main(){
//zadacha 4
    int numbers1[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 };
    int numbers2[] = { 1, 2, 3, 5, 6, 7, 8, 10 };
    int numbers1Sz = sizeof(numbers1) / sizeof(numbers1[0]);
    int numbers2Sz = sizeof(numbers2) / sizeof(numbers2[0]);
    cout << FindTheLargestSequence(numbers1, numbers2, numbers1Sz, numbers2Sz) << endl;
return 0;
}
int FindTheLargestSequence(int*numbers1, int* numbers2, int numbers1Sz, int numbers2Sz) {
    int currentCount = 0;
    int maxCount = 0;
    int i, j;
    int k = 0;
    for (i = 0; i < numbers1Sz; i++)
    {
        for (j = k; j < numbers2Sz; j++)
        {
            if (numbers1[i] == numbers2[j])
            {
                currentCount++;
                k++;
                break;
            }
            else
            {
                if (currentCount > maxCount)
                {
                    maxCount = currentCount;
                }
                else
                {
                    maxCount = currentCount;
                }
                currentCount = 0;
                break;
            }
        }
    }
    return maxCount;
}