These three problems are almost the same.

CF618F [Double Knapsack]: https://codeforces.net/problemset/problem/618/F

CF1836E [Twin Cluster]: https://codeforces.net/contest/1836/problem/E

Beijing College Entrance Exam:

Given two positive integer arrays $$$A$$$ and $$$B$$$, such that:

$$$len(A) = len(B) = n$$$

and

$$$\forall 1 \leq i \leq n$$$, $$$1 \leq a_i, b_i \leq n$$$.

Prove there are subsegments $$$[x, y] \subseteq [1, n]$$$, $$$[z, w] \subseteq [1, n]$$$ such that $$$A[x...y] = B[z...w]$$$.