Optimal Subsequences (Hard Version)
This is the harder version of the problem. In this version, $1 \le n, m \le 2\cdot10^5$. You can hack this problem if you locked […]
Optimal Subsequences
Optimal Subsequences (Easy Version)
This is the easier version of the problem. In this version $1 \le n, m \le 100$. You can hack this problem only if you […]
