void secvMaxima2(int n, int v[], int &pi2, int &pf2, int c)
{
    int i, j;
    int max, lung,s;
    max = 0;
    i = 0;
    pi2 = -1;
    pf2 = -1;
    while (i < n)
    {
        lung = 0;
        j = i ;
        s = 0;
        while (j<n)
        {
            s = s + v[j];
            j++;
            lung++;

            while ((j < n) && (v[j] == 0))
            {
                j++;
                lung++;
            }

            if (s==c)
            {
                if (lung > max)
                {
                    max = lung;
                    pi2 = i;
                    pf2 = j-1;
                    lung = 0;
                    int k = j + 1, sumaV=0;
	            	while(k<n)
		    		{
						sumaV = sumaV + v[k];
						if(sumaV == 0)
						{
							max = max + k - j;
							pf = pf + k - j;
						}
						k++;
                	}
            }

        }
        i++;
    }

}