zad Str:nai dulga posledovatelnost

#include <iostream>
#include <string>

using namespace std;

void naigolqmaduljina(char* sub, char* stringMnoj, int* counters, int sizeOfSub, int sizeOfString)
{

    int maxlengt = 0;
    int templengt = 0;



    for (int k = 0; k < strlen(sub); k++) {
        for (int j = 0; j < strlen(stringMnoj); j++) {

            if (sub[k] == stringMnoj[j])
            {
                templengt++;

                if (templengt > maxlengt)
                {
                    maxlengt = templengt;
                }
                break;
            }
            if (k == strlen(sub) && templengt== 0)
            {
                templengt = 0;
            }

        }
    }


    cout << "Nai sreshtanata posledovatelnost ot bukvi v mnojestvoto e  " << maxlengt << endl;

}



int main()
{
    //zadacha stringove
    // v sluchiq proverka na nai chesto sreshtan indeks ot mnojestvoto


    char subMnoj[] = { 'e','t','i','s' , '\0'};
    char stringMnoj[] = { "This is a test string!" };

    cout << "Mnojestvo: " << endl;
    for (int i = 0; i < strlen(stringMnoj); i++) {

        cout << subMnoj[i];

    }

    cout << endl << "String: " << stringMnoj << endl;

    int* countersForMnoj = new int[strlen(stringMnoj)]; //Razmera na cauntarite = na razmera na mnojestvoto
    for (int i = 0; i < strlen(stringMnoj); i++) {
        countersForMnoj[i] = 0;

    }

    naigolqmaduljina(subMnoj, stringMnoj, countersForMnoj, strlen(stringMnoj), strlen(stringMnoj));


    delete[]countersForMnoj;
    countersForMnoj = NULL;

    return 0;
}