4个点tle了不知道怎么优化，求解```c #include #include #include using namespace std; const int N = 101000; int a[N], b[N]; int f[N]; int main() { int n; cin >> n; for (int i = 1; i <= n; i++)cin >> a[i]; for (int i = 1; i <= n; i++)cin >> b[i]; for(int i=1;i<=n;i++) for (int j = 1; j <= n; j++) { f[j] = max(f[j], f[j - 1]); if (a[i] == b[j])f[j] = max(f[j], f[j - 1] + 1); } cout << f[n]; return 0; }