摘要： 时间复杂度：n*log nView Code #include <cstdio>#include <cstring>#include <iostream>using namespace std;const int maxn = 50005;int dp[maxn] , a[maxn];int Lis(int n) { int len = 1 , left , right , mid; dp[1] = a[1]; for(int i=2;i<=n;i++) { left = 1; right = len; while(left <= r... 阅读全文