C. Rotation Matching

// Problem: C. Rotation Matching
// Contest: Codeforces - Codeforces Round #648 (Div. 2)
// URL: https://codeforces.com/problemset/problem/1365/C
// Memory Limit: 256 MB
// Time Limit: 1000 ms
// 2022-02-28 21:03:24
// 
// Powered by CP Editor (https://cpeditor.org)

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

#define rep(i,l,r) for(int i=(l);i<=(r);i++)
#define per(i,l,r) for(int i=(l);i>=(r);i--)
#define ll long long
#define pii pair<int, int>
#define mset(s,t) memset(s,t,sizeof(t))
#define mcpy(s,t) memcpy(s,t,sizeof(t))
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define mp make_pair

const ll mod = 1e9 + 7;

inline ll qmi (ll a, ll b) {
	ll ans = 1;
	while (b) {
		if (b & 1) ans = ans * a%mod;
		a = a * a %mod;
		b >>= 1;
	}
	return ans;
}
inline int read () {
	int x = 0, f = 0;
	char ch = getchar();
	while (!isdigit(ch)) f |= (ch=='-'),ch= getchar();
	while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
	return f?-x:x;
}
template<typename T> void print(T x) {
	if (x < 0) putchar('-'), x = -x;
	if (x >= 10) print(x/10);
	putchar(x % 10 + '0');
}
inline ll sub (ll a, ll b) {
	return ((a - b ) %mod + mod) %mod;
}
inline ll add (ll a, ll b) {
	return (a + b) %mod;
}
inline ll inv (ll a) {
	return qmi(a, mod - 2);
}
const int N = 2e5 + 10;
int n;
int a[N], b[N];
int dif[N];
int get (int k) {
	
}
void solve() {
	cin >> n;
	for (int i = 1; i<= n ;i ++) {
		int t;
		cin >> t;
		a[t]  =i;
	}
	rep(i,1, n) cin >> b[i];
	int ans = 0;
	for (int i = 1; i <= n ;i ++) {
		int s = a[b[i]];
		int dis = 0;
		if (s >= i) dis = s - i;
		else dis = s - i + n;
		dif[dis] ++;
		ans = max (ans, dif[dis]);
	}
	cout << ans << endl;
}
int main () {
    int t;
    t =1;
    //cin >> t;
    while (t --) solve();
    return 0;
}

我没有存下下标因此导致找相同的时间非常大。 这里存储了下标然后记录每个数移到相同的位置需要多少操作。 如果某几个数需要相同的移动次数，那么对答案就会累计贡献 这是相同点