Marin and Photoshoot codeforces solution in c++

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
    int n;
    cin >> n;

    vector<int> a(n), b(n);

    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }

    for (int i = 0; i < n; ++i) {
        cin >> b[i];
    }

    vector<int> index_a(n), index_b(n);

    for (int i = 0; i < n; ++i) {
        index_a[a[i] - 1] = i;
        index_b[b[i] - 1] = i;
    }

    int max_diff = 0;
    vector<int> diff(n);

    for (int i = 0; i < n; ++i) {
        diff[i] = (index_b[i] - index_a[i] + n) % n;
        max_diff = max(max_diff, diff[i]);
    }

    cout << max_diff << endl;

    return 0;
}