Subsecventa Comuna de Lungime Maxima - Vector

#include <bits/stdc++.h>
#define LMAX 1024

using namespace std;

ifstream fin ("sclm.in");
ofstream fout ("sclm.out");

char a[LMAX + 1], b[LMAX + 1];
int mx[LMAX + 1];

int main() {
  int m, n, l, c, mmx, lmx, cmx;
  fin >> m >> n;
  fin.get();
  for ( l = 1; l <= m; l++ )
    a[l] = fin.get();
  fin.get();
  for ( c = 1; c <= n; c++ )
    b[c] = fin.get();
  mmx = cmx = lmx = 0;
  for ( l = 1; l <= m; l++ )
    for ( c = n; c > 0; c-- )
      if ( a[l] == b[c] ) {
        mx[c] = mx[c - 1] + 1;
        if ( mx[c] > mmx ) {
          mmx = mx[c];
          lmx = l;
          cmx = c;
        }
      }
      else
          mx[c] = 0;
  fout << mmx << ' ' << lmx - mmx + 1 << ' ' << cmx - mmx + 1 << '\n';
}