Yedl的专栏

2963 - Hypertransmission Time limit: 6.000 seconds Description The president of the Galactic Federation has recently decided that all planets of the galaxy must establish hyper-radio centers to b

Multiplication Puzzle Description The multiplication puzzle is played with a row of cards, each containing a single positive integer. During the move player takes one card out of the row and sco

题意：王子和公主同时从1出发走到 n*n， 求他们两个路径的最长公共子序列； 思路：因为这题n有250，如果用LCS负责度为O(n^2),容易超时，于是我们选择它的优化版Lis算法来求最长公共子序列，这样我们的复杂度就降为O(n*logn)了。 Lis算法：      先回顾经典的O(n^2)的动态规划算法，设A[t]表示序列中的第t个数，F[t]表示从1到t这一段中以t结尾的最长上升子序列