Submission #1437093

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

int n;
string s, t;
int beet[100];
int imo[1010101];

int main() {
  memset(beet, -1, sizeof(beet));

  cin >> n;
  cin >> s >> t;

  if (s == t) {
    cout << 0 << endl;
    return 0;
  }
  if (s[0] != t[0]) {
    cout << -1 << endl;
    return 0;
  }

  beet[s[0] - 'a'] = 0;

  s += '.';
  t += '.';
  n++;

  imo[0]++;
  for (int i = 1; i < n; ++i) {
    beet[s[i] - 'a'] = i;

    if (beet[t[i] - 'a'] == -1) {
      cout << -1 << endl;
      return 0;
    }

    if (t[i] != t[i - 1]) {
      imo[i]--;
      imo[beet[t[i] - 'a']]++;
    }
  }

  int ans = 0;
  for (int i = 1; i < n; ++i) {
    imo[i] += imo[i - 1];
    ans = max(ans, imo[i - 1]);
  }

  cout << ans << endl;
}

Submission Info

Judge Result