Envío 3946

Código

#include <bits/stdc++.h>

using namespace std;

int main()
{
  string str;
  int maxDif, subStrLen = 0, maxLen = 0, i = 0;
  map<char, int> tabla;
  int subStrFirstSequenceChar = str[i];
  int subStrFirstSequenceLen = 1;
  bool firstChar = true;

  cin >> str;
  cin >> maxDif;

  subStrFirstSequenceChar = str[i];
  subStrFirstSequenceLen = 1;
  firstChar = true;

  while (i < str.length())
  {
    if (firstChar && i + 1 < str.length() && subStrFirstSequenceChar == str[i + 1])
    {
      subStrFirstSequenceLen++;
    }
    else
    {
      firstChar = false;
    }

    tabla[str[i]];

    // Se supero el limite de caracteres permitido. Terminamos con esta substring y actualizamos nuestros numeros
    if (tabla.size() > maxDif)
    {
      // printf("se supero barrera en char: '%c'\n", str[i]);
      if (subStrLen > maxLen)
      {
        maxLen = subStrLen;
      }

      // Restamos de la tabla el tamano de la primera secuencia de caracteres de la substring que acabamos de analizar
      // printf("subStrFirstSequenceChar: %c\n", subStrFirstSequenceChar);
      // printf("subStrFirstSequenceLen: %d\n", subStrFirstSequenceLen);
      subStrLen -= subStrFirstSequenceLen;
      // printf("tabla[subStrFirstSequenceChar]: %d\n", tabla[subStrFirstSequenceChar]);
      tabla[subStrFirstSequenceChar] -= subStrFirstSequenceLen;
      if (tabla[subStrFirstSequenceChar] <= 0)
      {
        // printf("entra a eliminar '%c' de map\n", subStrFirstSequenceChar);
        tabla.erase(subStrFirstSequenceChar);
      }

      subStrFirstSequenceChar = str[i];
      subStrFirstSequenceLen = 1;
      tabla.erase(str[i]);
      firstChar = true;
    }
    else
    {
      i++;
      subStrLen++;
    }
  }
  if (subStrLen > maxLen)
  {
    maxLen = subStrLen;
  }

  cout << maxLen << endl;
}